default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWen-Hsuan Li
Person information
Other persons with a similar name
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[i5]Jwo-Yuh Wu, Liang-Chi Huang, Wen-Hsuan Li, Chun-Hung Liu:
A Metric Topology of Deep Learning for Data Classification. CoRR abs/2501.11265 (2025)- 2024
- [c7]Wen-Hsuan Li, Yu-Chih Huang:
Syndrome-Based Fusion Rules in Heterogeneous Distributed Quickest Change Detection. ISIT 2024: 1053-1058 - [i4]Wen-Hsuan Li, Yu-Chih Huang:
Syndrome-based Fusion Rules in Heterogeneous Distributed Quickest Change Detection. CoRR abs/2405.06933 (2024) - 2023
- [j3]Min-Xiang Hsu, Yu-Chih Huang
, Wen-Hsuan Li, Che-Fu Chu, Pin-Jui Wu:
An Efficient Algorithm and Quantization for Fully Distributed Sequential Change Detection. IEEE Trans. Commun. 71(10): 6088-6099 (2023) - [j2]Jwo-Yuh Wu, Liang-Chi Huang, Wen-Hsuan Li, Chun-Hung Liu, Rung-Hung Gau:
Greedier is Better: Selecting Multiple Neighbors per Iteration for Sparse Subspace Clustering. Trans. Mach. Learn. Res. 2023 (2023) - [c6]Wen-Hsuan Li, Yu-Chih Huang:
Bandwidth-Constrained Distributed Quickest Change Detection in Heterogeneous Sensor Networks: Anonymous vs Non-Anonymous Settings. ISIT 2023: 1384-1389 - 2022
- [i3]Wen-Hsuan Li, Yu-Chih Huang:
Bandwidth-Constrained Distributed Quickest Change Detection in Heterogeneous Sensor Networks: Anonymous vs Non-Anonymous Settings. CoRR abs/2202.02697 (2022) - [i2]Jwo-Yuh Wu, Liang-Chi Huang, Wen-Hsuan Li, Chun-Hung Liu, Rung-Hung Gau:
Greedier is Better: Selecting Multiple Neighbors per Iteration for Sparse Subspace Clustering. CoRR abs/2204.02572 (2022) - 2020
- [c5]Jwo-Yuh Wu, Liang-Chi Huang, Wen-Hsuan Li, Hau-Hsiang Chan, Chun-Hung Liu, Rung-Hung Gau:
Sparse Subspace Clustering with Linear Subspace-Neighborhood-Preserving Data Embedding. SAM 2020: 1-5 - [c4]Jwo-Yuh Wu, Wen-Hsuan Li, Liang-Chi Huang, Yen-Ping Lin, Chun-Hung Liu, Rung-Hung Gau:
Deterministic Coherence-Based Performance Guarantee for Noisy Sparse Subspace Clustering using Greedy Neighbor Selection. SAM 2020: 1-5 - [i1]Jwo-Yuh Wu, Wen-Hsuan Li, Liang-Chi Huang, Yen-Ping Lin, Chun-Hung Liu, Rung-Hung Gau:
Provable Noisy Sparse Subspace Clustering using Greedy Neighbor Selection: A Coherence-Based Perspective. CoRR abs/2002.00401 (2020)
2010 – 2019
- 2019
- [j1]Wen-Hsuan Li, Jwo-Yuh Wu:
BER-Improved Quantization of Source-to-Relay Link SNR for Cooperative Beamforming: A Fixed Point Theory Approach. IEEE Trans. Inf. Theory 65(7): 4532-4549 (2019) - [c3]Wen-Hsuan Li, Jwo-Yuh Wu:
BER-Aware Link SNR Quantization for Relay Beamforming: A Fixed-Point Theory Approach. ICSPCS 2019: 1-10 - 2018
- [c2]Wen-Hsuan Li, Jwo-Yuh Wu, Chia-Kang Hsu, Li-Chun Wang:
Least-Squares Pilot Sequence Design for TDD Massive MIMO Systems under Inter-Cell Timing Misalignment. PIMRC 2018: 1-5 - 2014
- [c1]Kai-Yu Yang, Jwo-Yuh Wu, Wen-Hsuan Li:
A low-complexity direction-of-arrival estimation algorithm for full-dimension massive MIMO systems. ICCS 2014: 472-476
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-24 21:30 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:
