default search action
Wei-Kun Chen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
- [j2]Wei-Kun Chen, Liang Chen, Yu-Hong Dai:
Lifting for the integer knapsack cover polyhedron. J. Glob. Optim. 86(1): 205-249 (2023) - 2021
- [j1]Ping-Fan Zhao, Qingna Li, Wei-Kun Chen, Ya-Feng Liu:
An Efficient Quadratic Programming Relaxation Based Algorithm for Large-Scale MIMO Detection. SIAM J. Optim. 31(2): 1519-1545 (2021)
Conference and Workshop Papers
- 2024
- [c4]Zheyu Wu, Wei-Kun Chen, Ya-Feng Liu, Christos Masouros:
CI-Based QoS-Constrained Transmit Signal Design for DFRC Systems with One-Bit DACs. SAM 2024: 1-5 - 2023
- [c3]Wei-Kun Chen, Ya-Feng Liu, Rui-Jin Zhang, Yu-Hong Dai, Zhi-Quan Luo:
An Efficient Decomposition Algorithm for Large-Scale Network Slicing. SPAWC 2023: 171-175 - [c2]Cheng-Yang Yu, Mingjie Shao, Wei-Kun Chen, Ya-Feng Liu, Wing-Kin Ma:
An Efficient Global Algorithm for One-Bit Maximum-Likelihood MIMO Detection. SPAWC 2023: 231-235 - 2022
- [c1]Wei-Kun Chen, Ya-Feng Liu, Yu-Hong Dai, Zhi-Quan Luo:
Optimal Qos-Aware Network Slicing for Service-Oriented Networks with Flexible Routing. ICASSP 2022: 5288-5292
Informal and Other Publications
- 2024
- [i10]Zheyu Wu, Ya-Feng Liu, Wei-Kun Chen, Christos Masouros:
Quantized Constant-Envelope Waveform Design for Massive MIMO DFRC Systems. CoRR abs/2403.06185 (2024) - [i9]Mingjie Shao, Wei-Kun Chen, Cheng-Yang Yu, Ya-Feng Liu, Wing-Kin Ma:
One-Bit MIMO Detection: From Global Maximum-Likelihood Detector to Amplitude Retrieval Approach. CoRR abs/2407.11079 (2024) - [i8]Wei-Kun Chen, Ya-Feng Liu, Yu-Hong Dai, Zhi-Quan Luo:
QoS-Aware and Routing-Flexible Network Slicing for Service-Oriented Networks. CoRR abs/2409.13943 (2024) - 2023
- [i7]Cheng-Yang Yu, Mingjie Shao, Wei-Kun Chen, Ya-Feng Liu, Wing-Kin Ma:
An Efficient Global Algorithm for One-Bit Maximum-Likelihood MIMO Detection. CoRR abs/2306.15167 (2023) - [i6]Wei-Kun Chen, Ya-Feng Liu, Rui-Jin Zhang, Yu-Hong Dai, Zhi-Quan Luo:
An Efficient Decomposition Algorithm for Large-Scale Network Slicing. CoRR abs/2306.15247 (2023) - 2022
- [i5]Zheyu Wu, Jiageng Wu, Wei-Kun Chen, Ya-Feng Liu:
Diversity Order Analysis for Quantized Constant Envelope Transmission. CoRR abs/2210.14543 (2022) - [i4]Jiang-Yao Luo, Liang Chen, Wei-Kun Chen, Jian-Hua Yuan, Yu-Hong Dai:
A Cut-and-solve Algorithm for Virtual Machine Consolidation Problem. CoRR abs/2212.12341 (2022) - 2021
- [i3]Wei-Kun Chen, Ya-Feng Liu, Fan Liu, Yu-Hong Dai, Zhi-Quan Luo:
Towards Efficient Large-Scale Network Slicing: An LP Rounding-and-Refinement Approach. CoRR abs/2107.14404 (2021) - [i2]Wei-Kun Chen, Ya-Feng Liu, Yu-Hong Dai, Zhi-Quan Luo:
Optimal QoS-Aware Network Slicing for Service-Oriented Networks with Flexible Routing. CoRR abs/2110.03915 (2021) - 2020
- [i1]Ping-Fan Zhao, Qing-Na Li, Wei-Kun Chen, Ya-Feng Liu:
An Efficient Quadratic Programming Relaxation Based Algorithm for Large-Scale MIMO Detection. CoRR abs/2006.12123 (2020)
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-18 20:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint