default search action
Meng Zeng
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j13]Xibin Jia, Chen Li, Meng Zeng, Luo Wang, Qing Mi:
An improved unified domain adversarial category-wise alignment network for unsupervised cross-domain sentiment classification. Eng. Appl. Artif. Intell. 126(Part D): 107108 (2023) - [j12]Meng Zeng, Beiji Zou, Xiaoyan Kui, Chengzhang Zhu, Ling Xiao, Zhi Chen, Jingyu Du:
PA-LBF: Prefix-Based and Adaptive Learned Bloom Filter for Spatial Data. Int. J. Intell. Syst. 2023: 1-19 (2023) - [j11]Meng Zeng, Beiji Zou, Wensheng Zhang, Xuebing Yang, Guilan Kong, Xiaoyan Kui, Chengzhang Zhu:
Two-layer partitioned and deletable deep bloom filter for large-scale membership query. Inf. Syst. 119: 102267 (2023) - [c13]Meng Zeng, Zhonglin Zhang:
Text Sentiment Classification Model based on Fusion of DualChannel Features of CNN and BiLSTM. ADMIT 2023: 110-113 - 2022
- [j10]Meng Zeng, Bin Ning, Qiong Gu, Chunyang Hu, Shuijia Li:
Hyper-graph regularized subspace clustering with skip connections for band selection of hyperspectral image. Comput. Sci. Inf. Syst. 19(2): 783-801 (2022) - [c12]Beiji Zou, Tao Zhang, Chengzhang Zhu, Ling Xiao, Meng Zeng, Zhi Chen:
Alps: An Adaptive Load Partitioning Scaling Solution for Stream Processing System on Skewed Stream. DEXA (2) 2022: 17-31 - [c11]Beiji Zou, Meng Zeng, Chengzhang Zhu, Ling Xiao, Zhi Chen:
A Learned Prefix Bloom Filter for Spatial Data. DEXA (1) 2022: 336-350 - [c10]Beiji Zou, Zhi Chen, Chengzhang Zhu, Ling Xiao, Meng Zeng:
Entity-level Attention Pooling and Information Gating for Document-level Relation Extraction. ICPR 2022: 1407-1413 - 2021
- [j9]Fang Zong, Meng Wang, Ming Tang, Xiying Li, Meng Zeng:
An Improved Intelligent Driver Model Considering the Information of Multiple Front and Rear Vehicles. IEEE Access 9: 66241-66252 (2021) - [j8]Yaoming Cai, Meng Zeng, Zhihua Cai, Xiaobo Liu, Zijia Zhang:
Graph Regularized Residual Subspace Clustering Network for hyperspectral image clustering. Inf. Sci. 578: 85-101 (2021) - [c9]Ling Xiao, Beiji Zou, Chengzhang Zhu, Meng Zeng, Zhi Chen:
HFBT: An Efficient Hierarchical Fault-tolerant Method for Cloud Storage System. ISPA/BDCloud/SocialCom/SustainCom 2021: 27-36 - 2020
- [j7]Meng Zeng, Bin Ning, Chunyang Hu, Qiong Gu, Yaoming Cai, Shuijia Li:
Hyper-Graph Regularized Kernel Subspace Clustering for Band Selection of Hyperspectral Image. IEEE Access 8: 135920-135932 (2020)
2010 – 2019
- 2019
- [j6]Fang Zong, Meng Zeng, Wei Zhong, Fengrui Lu:
Hybrid Path Selection Modeling by Considering Habits and Traffic Conditions. IEEE Access 7: 43781-43794 (2019) - [j5]Meng Zeng, Yaoming Cai, Zhihua Cai, Xiaobo Liu, Peng Hu, Junhua Ku:
Unsupervised Hyperspectral Image Band Selection Based on Deep Subspace Clustering. IEEE Geosci. Remote. Sens. Lett. 16(12): 1889-1893 (2019) - [c8]Meng Zeng, Yaoming Cai, Xiaobo Liu, Zhihua Cai, Xiang Li:
Spectral-Spatial Clustering of Hyperspectral Image Based on Laplacian Regularized Deep Subspace Clustering. IGARSS 2019: 2694-2697 - 2018
- [c7]Yaoming Cai, Zhihua Cai, Meng Zeng, Xiaobo Liu, Jia Wu, Guangjun Wang:
A Novel Deep Learning Approach: Stacked Evolutionary Auto-encoder. IJCNN 2018: 1-8 - 2013
- [j4]Meng Zeng, Rui Zhang, Shuguang Cui:
Outage Capacity and Optimal Transmission for Dying Channels. IEEE Trans. Commun. 61(1): 357-367 (2013) - [j3]Chuan Huang, Meng Zeng, Shuguang Cui:
Source Power Allocation and Relaying Design for Two-Hop Interference Networks with Relay Conferencing. IEEE Trans. Wirel. Commun. 12(7): 3213-3225 (2013) - 2012
- [j2]Meng Zeng, A. Robert Calderbank, Shuguang Cui:
On Design of Rateless Codes over Dying Binary Erasure Channel. IEEE Trans. Commun. 60(4): 889-894 (2012) - [c6]Ahsan Aziz, Meng Zeng, Jianwei Zhou, Costas N. Georghiades, Shuguang Cui:
Robust beamforming with channel uncertainty for two-way relay networks. ICC 2012: 3632-3636 - 2011
- [j1]Meng Zeng, Rui Zhang, Shuguang Cui:
On Design of Collaborative Beamforming for Two-Way Relay Networks. IEEE Trans. Signal Process. 59(5): 2284-2295 (2011) - [c5]Chuan Huang, Meng Zeng, Shuguang Cui:
Achievable Rates of Two-Hop Interference Networks with Conferencing Relays. GLOBECOM 2011: 1-6 - 2010
- [i3]Meng Zeng, Rui Zhang, Shuguang Cui:
On Design of Distributed Beamforming for Two-Way Relay Networks. CoRR abs/1005.1711 (2010) - [i2]Meng Zeng, Rui Zhang, Shuguang Cui:
On Design of Collaborative Beamforming for Two-Way Relay Networks. CoRR abs/1010.4980 (2010)
2000 – 2009
- 2009
- [c4]Meng Zeng, Rui Zhang, Shuguang Cui:
Optimal Transmission for Dying Channels. ICC 2009: 1-5 - [i1]Meng Zeng, Rui Zhang, Shuguang Cui:
Outage Capacity and Optimal Transmission for Dying Channels. CoRR abs/0905.2413 (2009) - 2008
- [c3]Meng Zeng, Rui Zhang, Shuguang Cui:
On the Outage Capacity of a Dying Channel. GLOBECOM 2008: 1002-1006 - 2007
- [c2]Meng Zeng, Jun Wang, Shaoqian Li:
Opportunistic Multiuser Beamforming based on Spatial Signature Matching. PIMRC 2007: 1-5 - [c1]Meng Zeng, Jun Wang, Shaoqian Li:
Rate Upper Bound and Optimal Number of Weight Vectors for Opportunistic Beamforming. VTC Fall 2007: 661-665
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:06 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint