Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Qi Zhu 0004

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Er-Ke Shang

> Home > Persons > Qi Zhu 0004

Publications

2023
[j1]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/sensors/0007XZS0023
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/sensors/0007XZS0023
Liang Xiao, Jiaolong Xu, Dawei Zhao, Er-Ke Shang, Qi Zhu, Bin Dai:
Adversarial and Random Transformations for Robust Domain Adaptation and Generalization. Sensors 23(11): 5273 (2023)
2022
[i1]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2211-06788
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2211-06788
Liang Xiao, Jiaolong Xu, Dawei Zhao, Er-Ke Shang, Qi Zhu, Bin Dai:
Adversarial and Random Transformations for Robust Domain Adaptation and Generalization. CoRR abs/2211.06788 (2022)
2020
[c7]
- view
  authority control:
- export record
  dblp key:
  - conf/itsc/ShangDNZXZ20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/itsc/ShangDNZXZ20
Er-Ke Shang, Bin Dai, Yiming Nie, Qi Zhu, Liang Xiao, Dawei Zhao:
A Guide-line and Key-point based A-star Path Planning Algorithm For Autonomous Land Vehicles. ITSC 2020: 1-7

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.