default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYuh-Ming Huang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
[c5]Jyun-Ying Huang, Yin-Chen Liang, Yuh-Ming Huang:
Secure integer arithmetic coding with adjustable interval size. APCC 2013: 683-687- 2012
- [j14]Yuh-Ming Huang, Sheng-Chi Wu:
The construction of binary Huffman equivalent codes with a greater number of synchronising codewords. Int. J. Ad Hoc Ubiquitous Comput. 9(1): 54-65 (2012) - 2011
- [c4]Yuh-Ming Huang, Yin-Chen Liang:
A secure arithmetic coding algorithm based on integer implementation. ISCIT 2011: 518-521 - 2010
- [j13]Yuh-Ming Huang, Ting-Yi Wu, Yunghsiang S. Han:
An A*-Based Algorithm for Constructing Reversible Variable Length Codes with Minimum Average Codeword Length. IEEE Trans. Commun. 58(11): 3175-3185 (2010) - [c3]Hung-Yu Chien, Ying-Lun Chen, Chien-Feng Lo, Yuh-Ming Huang:
A Novel E-Newspapers Publication System Using Provably Secure Time-Bound Hierarchical Key Assignment Scheme and XML Security. GPC 2010: 407-417
2000 – 2009
- 2008
- [j12]Yuh-Ming Huang, Yunghsiang S. Han, Ting-Yi Wu:
Soft-decision priority-first decoding algorithms for variable-length error-correcting codes. IEEE Commun. Lett. 12(8): 572-574 (2008) - [c2]Yuh-Ming Huang, Yunghsiang S. Han:
Trellis-Based Joint Huffman and Convolutional Soft-Decision Priority-First Decoding. DCC 2008: 521 - 2003
- [c1]Yuh-Ming Huang, Sheng-Chi Wu:
Shortest Synchronizing Codewords of A Binary Huffman Equivalent Code. ITCC 2003: 226-231 - 2002
- [j11]Ja-Ling Wu, Yuen-Hsien Tseng, Yuh-Ming Huang:
Neural Network Decoders for Linear Block Codes. Int. J. Comput. Eng. Sci. 3(3): 235-256 (2002) - 2000
- [j10]Yuh-Ming Huang, Ja-Ling Wu
:
Polynomial transform based algorithms for computing two-dimensional generalized DFT, generalized DHT, and skew circular convolution. Signal Process. 80(10): 2255-2260 (2000) - [j9]Yuh-Ming Huang, Ja-Ling Wu, Chi-Lun Chang:
A generalized output pruning algorithm for matrix-vector multiplication and its application to compute pruning discrete cosine transform. IEEE Trans. Signal Process. 48(2): 561-563 (2000)
1990 – 1999
- 1999
- [j8]Yuh-Ming Huang, Ja-Ling Wu:
A refined fast 2-D discrete cosine transform algorithm. IEEE Trans. Signal Process. 47(3): 904-907 (1999) - 1997
- [j7]Ming-Chwen Yang, Ja-Ling Wu, Yuh-Ming Huang:
Normal bases expansion of the discrete cosine transform. IEEE Trans. Signal Process. 45(5): 1348-1350 (1997) - 1994
- [j6]Yuh-Ming Huang, Sheng-Uei Guan:
A refined cut-through buffer management scheme for layered protocol stacks. IEEE Commun. Mag. 32(3): 82-85 (1994) - 1992
- [j5]Ja-Ling Wu, Yuh-Ming Huang:
A novel modularized fast polynomial transform algorithm for two-dimensional convolutions. Signal Process. 26(1): 27-36 (1992) - [j4]Ja-Ling Wu, Yuh-Ming Huang:
Two-variable modularized fast polynomial transform algorithm for 2-D discrete Fourier transforms. IEEE Trans. Circuits Syst. Video Technol. 2(1): 84-87 (1992) - 1991
- [j3]Ja-Ling Wu, Yuh-Ming Huang:
Comments on 'An FPT algorithm with a modularized structure for computing 2-D cyclic convolutions' by T.K. Truong, et al. IEEE Trans. Signal Process. 39(5): 1238 (1991) - [j2]Ja-Ling Wu, Yuh-Ming Huang:
An FPT algorithm with a modularized structure for computing two-dimensional discrete Fourier transforms. IEEE Trans. Signal Process. 39(9): 2148-2149 (1991)
1980 – 1989
- 1989
- [j1]Ja-Ling Wu, Yuh-Ming Huang, Jiun Shiu, Shyh-Huei Hsu:
Block Diagonal Structure in Discrete Transforms. J. Inf. Sci. Eng. 5(1): 17-33 (1989)
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-25 05:47 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:
