default search action
Qian Xu 0010
Person information
- affiliation (PhD 2020): City University of Hong Kong, Hong Kong
Other persons with the same name
- Qian Xu — disambiguation page
- Qian Xu 0001 — Texas A&M University, Department of Electrical and Computer Engineering, College Station, TX, USA
- Qian Xu 0002
— Elon University, School of Communications, NC, USA (and 1 more)
- Qian Xu 0003 — Technicolor, Research and Innovations, Princeton, NJ, USA (and 1 more)
- Qian Xu 0004 — Northeast Normal University, China
- Qian Xu 0005 — WeBank, Shenzhen, China (and 2 more)
- Qian Xu 0006 — University of Huddersfield, CGIV Research Group, UK
- Qian Xu 0007
- Qian Xu 0008
- Qian Xu 0009 — Arizona State University, Tempe, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j4]Yifan Zhang
A Learning-Based Discretionary Lane-Change Decision-Making Model With Driving Style Awareness. IEEE Trans. Intell. Transp. Syst. 24(1): 68-78 (2023) - [c7]Yang Lou
Uncertainty-Encoded Multi-Modal Fusion for Robust Object Detection in Autonomous Driving. ECAI 2023: 1593-1600 - [i2]Yang Lou, Qun Song, Qian Xu, Rui Tan, Jianping Wang:
Uncertainty-Encoded Multi-Modal Fusion for Robust Object Detection in Autonomous Driving. CoRR abs/2307.16121 (2023) - 2022
- [j3]Zhongzheng Tang
SNIFF: A Scalable Network Inference Framework for Measuring End-to-End Performance. IEEE Trans. Netw. Sci. Eng. 9(3): 1909-1923 (2022) - [c6]Chengyuan Xu
AoI-centric Task Scheduling for Autonomous Driving Systems. INFOCOM 2022: 1019-1028 - 2021
- [j2]Qian Xu
Leveraging Multiplexing Gain in Network Slice Bundles. IEEE Trans. Netw. Sci. Eng. 8(1): 149-162 (2021) - 2020
- [j1]Qian Xu
Learning-Based Dynamic Resource Provisioning for Network Slicing with Ensured End-to-End Performance Bound. IEEE Trans. Netw. Sci. Eng. 7(1): 28-41 (2020) - [i1]Yifan Zhang, Qian Xu, Jianping Wang, Kui Wu, Zuduo Zheng, Kejie Lu:
A Learning-based Discretionary Lane-Change Decision-Making Model with Driving Style Awareness. CoRR abs/2010.09533 (2020)
2010 – 2019
- 2019
- [c5]Luning Wang, Zhongzheng Tang, Qian Xu, Kejie Lu, Jianping Wang, Kui Wu, Xiaohua Jia:
SNIFF: A Scalable Network Inference Framework for Measuring End-to-End Performance Based on Matrix Completion. BigCom 2019: 231-239 - [c4]Qian Xu
Evaluating and Boosting Reinforcement Learning for Intra-Domain Routing. MASS 2019: 265-273 - 2018
- [c3]Qian Xu
Resource Capacity Analysis in Network Slicing with Ensured End-to-End Performance Bound. ICC 2018: 1-6 - 2017
- [c2]Michael A. Beck, Sebastian A. Henningsen, Qian Xu
Demo abstract: An integrated tool of applying stochastic network calculus for network performance analysis. INFOCOM Workshops 2017: 964-965 - 2016
- [c1]Min Cheng, Qian Xu
MS-LSTM: A multi-scale LSTM model for BGP anomaly detection. ICNP 2016: 1-6
Coauthor Index
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-02-20 19:45 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: