default search action
Mengyao Ge
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2018
- [b1]Mengyao Ge:
Optimizing multiuser MIMO for access point cooperation in dense wireless networks. Georgia Institute of Technology, Atlanta, GA, USA, 2018
Journal Articles
- 2024
- [j6]Wenjuan Han, Jiaxin Shen, Yanyao Liu, Zhan Shi, Jinan Xu, Fangxu Hu, Hao Chen, Yan Gong, Xueli Yu, Huaqing Wang, Zhijing Liu, Yajie Yang, Tianshui Shi, Mengyao Ge:
LegalAsst: Human-centered and AI-empowered machine to enhance court productivity and legal assistance. Inf. Sci. 679: 121052 (2024) - 2018
- [j5]Mengyao Ge, Douglas M. Blough:
High Throughput and Fair Scheduling for Multi-AP Multiuser MIMO in Dense Wireless Networks. IEEE/ACM Trans. Netw. 26(5): 2414-2427 (2018) - 2013
- [j4]Shaowei Wang, Zhi-Hua Zhou, Mengyao Ge, Chonggang Wang:
Resource Allocation for Heterogeneous Cognitive Radio Networks with Imperfect Spectrum Sensing. IEEE J. Sel. Areas Commun. 31(3): 464-475 (2013) - [j3]Shaowei Wang, Mengyao Ge, Chonggang Wang:
Efficient Resource Allocation for Cognitive Radio Networks with Cooperative Relays. IEEE J. Sel. Areas Commun. 31(11): 2432-2441 (2013) - [j2]Shaowei Wang, Mengyao Ge, Wentao Zhao:
Energy-Efficient Resource Allocation for OFDM-Based Cognitive Radio Networks. IEEE Trans. Commun. 61(8): 3181-3191 (2013) - 2012
- [j1]Mengyao Ge, Shaowei Wang:
Fast Optimal Resource Allocation is Possible for Multiuser OFDM-Based Cognitive Radio Networks with Heterogeneous Services. IEEE Trans. Wirel. Commun. 11(4): 1500-1509 (2012)
Conference and Workshop Papers
- 2018
- [c9]Mengyao Ge, Douglas M. Blough:
Mobility-Aware Multi-User MIMO Link Scheduling for Dense Wireless Networks. ICC 2018: 1-7 - 2017
- [c8]Mengyao Ge, Douglas M. Blough:
PBUS: Efficient User Selection for Block Diagonalization in Dense Wireless Networks. GLOBECOM 2017: 1-7 - [c7]Mengyao Ge, Douglas M. Blough:
High-Throughput and Fair Scheduling for Access Point Cooperation in Dense Wireless Networks. WCNC 2017: 1-6 - [c6]Mengyao Ge, John R. Barry, Douglas M. Blough:
Combined User Selection and MIMO Weight Calculation for AP Cooperation in Dense Wireless Networks. WCNC 2017: 1-6 - 2014
- [c5]Mengyao Ge, Shaowei Wang:
On the resource allocation for multi-relay cognitive radio systems. ICC 2014: 1585-1589 - 2013
- [c4]Qianyu Yang, Shaowei Wang, Mengyao Ge:
Cooperative resource allocation in OFDM-based multicell cognitive radio systems. ICNC 2013: 724-728 - [c3]Mengyao Ge, Shaowei Wang:
Energy-efficient power allocation for cooperative relaying Cognitive Radio networks. WCNC 2013: 691-696 - 2012
- [c2]Shaowei Wang, Fangjiang Huang, Mengyao Ge, Chonggang Wang:
Optimal power allocation for OFDM-based cooperative relay cognitive radio networks. ICC 2012: 1651-1655 - [c1]Shaowei Wang, Zhi-Hua Zhou, Mengyao Ge, Chonggang Wang:
Resource allocation for heterogeneous multiuser OFDM-based cognitive radio networks with imperfect spectrum sensing. INFOCOM 2012: 2264-2272
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 2024-10-07 22:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint