default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDQing He 0002
Person information
- affiliation (PhD 2016): Linköping University, Sweden
Other persons with the same name
- Qing He — disambiguation page
- Qing He 0001 — Massachusetts Institute of Technology, Cambridge, USA
- Qing He 0003
![[0000-0001-8833-5398]](https://dblp.org/img/orcid-mark.12x12.png "0000-0001-8833-5398")
— Chinese Academy of Sciences, Institute of Computing Technology, Key Lab of Intelligent Information Processing, Beijing, China - Qing He 0004 — Northeast Forestry University, College of Engineering and Technology, Harbin, China
- Qing He 0005 — National Institute of Metrology, Beijing, China (and 1 more)
- Qing He 0006 — University of Pennsylvania, Philadelphia, PA, USA (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j10]Georgios P. Koudouridis, Qing He, György Dán:
An architecture and performance evaluation framework for artificial intelligence solutions in beyond 5G radio access networks. EURASIP J. Wirel. Commun. Netw. 2022(1): 94 (2022)- [c14]Yi Zhao, Zhanwei Yu, Qing He, Di Yuan:
Content Caching with Personalized and Incumbent-aware Recommendation: An optimization Approach. WiOpt 2022: 97-104 - 2020
- [j9]Qing He, Arash Moayyedi, György Dán, Georgios P. Koudouridis, Per Tengkvist:
A Meta-Learning Scheme for Adaptive Short-Term Network Traffic Prediction. IEEE J. Sel. Areas Commun. 38(10): 2271-2283 (2020) - [j8]Qing He, Di Yuan, Anthony Ephremides:
Optimal Scheduling for Emptying a Wireless Network: Solution Characterization, Applications, Including Deadline Constraints. IEEE Trans. Inf. Theory 66(3): 1882-1892 (2020) - [c13]Qing He, György Dán, Georgios P. Koudouridis:
Semi-Persistent Scheduling for 5G Downlink Based on Short-Term Traffic Prediction. GLOBECOM 2020: 1-6 - [c12]Qing He, Georgios P. Koudouridis, György Dán:
A Comparison of Machine and Statistical Time Series Learning for Encrypted Traffic Prediction. ICNC 2020: 714-718
2010 – 2019
- 2019
- [j7]Lei Lei, Lei You, Qing He, Thang X. Vu, Symeon Chatzinotas, Di Yuan, Björn E. Ottersten:
Learning-Assisted Optimization for Energy-Efficient Scheduling in Deadline-Aware NOMA Systems. IEEE Trans. Green Commun. Netw. 3(3): 615-627 (2019) - [j6]Qing He, György Dán, Viktoria Fodor:
Joint Assignment and Scheduling for Minimizing Age of Correlated Information. IEEE/ACM Trans. Netw. 27(5): 1887-1900 (2019) - [c11]Qing He, György Dán, Viktoria Fodor:
On Emptying a Wireless Network with Minimum-Energy Under Age Constraints. INFOCOM Workshops 2019: 668-673 - 2018
- [j5]Qing He, Di Yuan, Anthony Ephremides:
Optimal Link Scheduling for Age Minimization in Wireless Systems. IEEE Trans. Inf. Theory 64(7): 5381-5394 (2018) - [c10]Qing He, György Dán, Viktoria Fodor:
Minimizing age of correlated information for wireless camera networks. INFOCOM Workshops 2018: 547-552 - 2017
- [j4]Qing He, Di Yuan, Anthony Ephremides:
Maximum Link Activation with Cooperative Transmission and Interference Cancellation in Wireless Networks. IEEE Trans. Mob. Comput. 16(2): 408-421 (2017) - [c9]Qing He, Di Yuan, Anthony Ephremides:
On optimal link scheduling with deadlines for emptying a wireless network. ISIT 2017: 461-465 - [c8]Lei Lei, Eva Lagunas, Sina Maleki, Qing He, Symeon Chatzinotas, Björn E. Ottersten:
Energy optimization for full-duplex self-backhauled HetNet with non-orthogonal multiple access. SPAWC 2017: 1-5 - 2016
- [b1]Qing He:
A Comprehensive Analysis of Optimal Link Scheduling for Emptying a Wireless Network. Linköping University, Sweden, 2016 - [j3]Qing He, Vangelis Angelakis, Anthony Ephremides, Di Yuan:
Polynomial Complexity Minimum-Time Scheduling in a Class of Wireless Networks. IEEE Trans. Control. Netw. Syst. 3(3): 322-331 (2016) - [c7]Qing He, Di Yuan, Anthony Ephremides:
On optimal link scheduling with min-max peak age of information in wireless systems. ICC 2016: 1-7 - [c6]Qing He, Di Yuan, Anthony Ephremides:
A general optimality condition of link scheduling for emptying a wireless network. ISIT 2016: 1446-1450 - [c5]Ming Lei, Xingjun Zhang, Tong Zhang, Lei Lei, Qing He, Di Yuan:
Successive Interference Cancellation for Throughput Maximization in Wireless Powered Communication Networks. VTC Fall 2016: 1-6 - [c4]Qing He, Di Yuan, Anthony Ephremides:
Optimizing freshness of information: On minimum age link scheduling in wireless systems. WiOpt 2016: 115-122 - 2015
- [j2]Eleftherios Karipidis, Di Yuan, Qing He, Erik G. Larsson:
Max-Min Power Control in Wireless Networks With Successive Interference Cancelation. IEEE Trans. Wirel. Commun. 14(11): 6269-6282 (2015) - 2014
- [j1]Vangelis Angelakis, Anthony Ephremides, Qing He, Di Yuan:
Minimum-Time Link Scheduling for Emptying Wireless Systems: Solution Characterization and Algorithmic Framework. IEEE Trans. Inf. Theory 60(2): 1083-1100 (2014) - [c3]Qing He, Di Yuan:
Maximum link activation in wireless networks with cooperative transmission and successive interference cancellation. PIMRC 2014: 1120-1124 - [i2]Qing He, Vangelis Angelakis, Anthony Ephremides, Di Yuan:
Polynomial Complexity Minimum-Time Scheduling in a Class of Wireless Networks. CoRR abs/1403.4144 (2014) - 2012
- [c2]Vangelis Angelakis, Anthony Ephremides, Qing He, Di Yuan:
On emptying a wireless network in minimum time. ISIT 2012: 2671-2675 - [c1]Qing He, Vangelis Angelakis, Anthony Ephremides, Di Yuan:
Revisiting minimum-length scheduling in wireless networks: An algorithmic framework. ISITA 2012: 506-510 - [i1]Vangelis Angelakis, Anthony Ephremides, Qing He, Di Yuan:
Minimum-Length Scheduling with Finite Queues: Solution Characterization and Algorithmic Framework. CoRR abs/1207.4589 (2012)
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-04-29 22:21 CEST 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:
