default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChun-Hao Hsu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
[c6]Hairong Jiang, Chun-Hao Hsu, Bradley S. Duerstock, Juan P. Wachs:
Determining natural and accessible gestures using uncontrolled manifolds and cybernetics. IROS 2015: 4078-4083- 2010
- [j4]Chun-Hao Hsu, Achilleas Anastasopoulos:
Capacity-achieving codes with bounded graphical complexity and maximum likelihood decoding. IEEE Trans. Inf. Theory 56(3): 992-1006 (2010)
2000 – 2009
- 2009
- [c5]Chyuan-Huei Thomas Yang, Chun-Hao Hsu:
A High Quality Reversible Data Hiding Method Using Interpolation Technique. IAS 2009: 603-606 - 2008
- [j3]Yin-Fu Huang, Chun-Hao Hsu:
PubMed smarter: Query expansion with implicit words based on gene ontology. Knowl. Based Syst. 21(8): 927-933 (2008) - [j2]Chun-Hao Hsu, Achilleas Anastasopoulos:
Capacity Achieving LDPC Codes Through Puncturing. IEEE Trans. Inf. Theory 54(10): 4698-4706 (2008) - 2007
- [c4]Chun-Hao Hsu, Jian Jhen Chen, Shiao-Li Tsao:
Evaluation and modeling of power consumption of a heterogeneous dual-core processor. ICPADS 2007: 1-8 - 2006
- [i2]Chun-Hao Hsu, Achilleas Anastasopoulos:
Iterative Decoding Performance Bounds for LDPC Codes on Noisy Channels. CoRR abs/cs/0607020 (2006) - 2005
- [j1]Chun-Hao Hsu, Achilleas Anastasopoulos:
Design and analysis of joint data detection and frequency/phase estimation algorithms. IEEE J. Sel. Areas Commun. 23(9): 1707-1717 (2005) - [c3]Chun-Hao Hsu, Achilleas Anastasopoulos:
Asymptotic weight distributions of irregular repeat-accumulate codes. GLOBECOM 2005: 5 - [i1]Chun-Hao Hsu, Achilleas Anastasopoulos:
Capacity-Achieving Codes with Bounded Graphical Complexity on Noisy Channels. CoRR abs/cs/0509062 (2005) - 2004
- [c2]Chun-Hao Hsu, Achilleas Anastasopoulos:
Subexponential-complexity exact sequence detection in the presence of frequency and phase uncertainty. ICC 2004: 499-503 - [c1]Chun-Hao Hsu, Achilleas Anastasopoulos:
Maximum likelihood decoding of trellis codes in fading channels with no receiver CSI is a polynomial-complexity problem. ISIT 2004: 147
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-04-24 23:14 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:
