default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHoward Cheng
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[c21]Behnam Kamranian, Howard Cheng
:
Event-Based Looming Objects Detection. IWSSIP 2021: 82-95
2010 – 2019
- 2018
- [j12]Mohammad Akbari, Jie Liang, Howard Cheng:
A real-time system for online learning-based visual transcription of piano music. Multim. Tools Appl. 77(19): 25513-25535 (2018) - 2017
- [c20]Iffatur Ridwan, Howard Cheng:
An Event-Based Optical Flow Algorithm for Dynamic Vision Sensors. ICIAR 2017: 182-189 - 2015
- [j11]Mohammad Akbari, Howard Cheng:
Real-Time Piano Music Transcription Based on Computer Vision. IEEE Trans. Multim. 17(12): 2113-2121 (2015) - [c19]Mohammad Akbari, Howard Cheng:
Clavision: visual automatic piano music transcription. NIME 2015: 313-314 - [c18]Howard Cheng, Camara Lerner:
Bit allocation for lossy image set compression. PACRIM 2015: 52-57 - 2014
- [j10]Howard Cheng, Satyan L. Devadoss, Brian Li, Andrej Risteski:
Skeletal configurations of ribbon trees. Discret. Appl. Math. 170: 46-54 (2014) - [c17]Camara Lerner, Howard Cheng:
Rate-distortion approach to bit allocation in lossy image set compression. IWSSIP 2014: 227-230 - 2012
- [c16]Oswin Aichholzer, Howard Cheng, Satyan L. Devadoss, Thomas Hackl, Stefan Huber, Brian Li, Andrej Risteski:
What makes a Tree a Straight Skeleton? CCCG 2012: 253-258 - [i2]Howard Cheng, Satyan L. Devadoss, Brian Li, Andrej Risteski:
Skeletal Rigidity of Phylogenetic Trees. CoRR abs/1203.5782 (2012) - 2011
- [c15]Vivek Trivedi, Howard Cheng:
Lossless Compression of Satellite Image Sets Using Spatial Area Overlap Compensation. ICIAR (2) 2011: 243-252 - 2010
- [c14]Marc Moreau, Howard Cheng:
Wavelet-based Prediction Measures for Lossy Image Set Compression. IPCV 2010: 597-601
2000 – 2009
- 2009
- [j9]Howard Cheng, George Labahn:
Applying linear algebra routines to modular ore polynomial matrix algorithms. ACM Commun. Comput. Algebra 43(3/4): 78-79 (2009) - [c13]Howard Cheng, George Labahn:
A Practical Implementation of a Modular Algorithm for Ore Polynomial Matrices. ASCM 2009: 49-59 - [c12]Anthony Schmieder, Howard Cheng, Xiaobo Li:
A Study of Clustering Algorithms and Validity for Lossy Image Set Compression. IPCV 2009: 501-506 - 2008
- [j8]Howard Cheng, George Labahn, Wei Zhou:
Computing polynomial LCM and GCD in lagrange basis. ACM Commun. Comput. Algebra 42(3): 129-130 (2008) - [c11]Anthony Schmieder, Howard Cheng, Barry Gergel, Xiaobo Li:
Hierarchical Minimum Spanning Trees for Lossy Image Set Compression. IPCV 2008: 57-63 - [c10]Barry Gergel, Anthony Schmieder, Xiaobo Li, Howard Cheng:
A Study of Prediction Measures for Lossy Image Set Compression. IPCV 2008: 69-74 - 2007
- [j7]Howard Cheng, George Labahn:
Output-sensitive modular algorithms for polynomial matrix normal forms. J. Symb. Comput. 42(7): 733-750 (2007) - [c9]Howard Cheng, Guillaume Hanrot, Emmanuel Thomé, Paul Zimmermann, Eugene V. Zima:
Time-and space-efficient evaluation of some hypergeometric constants. ISSAC 2007: 85-91 - [i1]Howard Cheng, Guillaume Hanrot, Emmanuel Thomé, Eugene V. Zima, Paul Zimmermann:
Time- and Space-Efficient Evaluation of Some Hypergeometric Constants. CoRR abs/cs/0701151 (2007) - 2006
- [j6]Bernhard Beckermann, Howard Cheng, George Labahn:
Fraction-free row reduction of matrices of Ore polynomials. J. Symb. Comput. 41(5): 513-543 (2006) - [c8]Barry Gergel, Howard Cheng, Xiaobo Li:
A Unified Framework for Lossless Image Set Compression. DCC 2006: 448 - [c7]Barry Gergel, Howard Cheng, Clinton Nielsen, Xiaobo Li:
A Unified Framework for Image Set Compression. IPCV 2006: 417-423 - [c6]Howard Cheng, George Labahn:
On computing polynomial GCDs in alternate bases. ISSAC 2006: 47-54 - 2005
- [j5]Howard Cheng, Barry Gergel, Ethan Kim, Eugene V. Zima:
Space-efficient evaluation of hypergeometric series. SIGSAM Bull. 39(2): 41-52 (2005) - [j4]Howard Cheng, Barry Gergel, Ethan Kim, Eugene V. Zima:
Space-efficient evaluation of hypergeometric series. SIGSAM Bull. 39(3): 81-83 (2005) - 2002
- [c5]Bernhard Beckermann, Howard Cheng, George Labahn:
Fraction-free row reduction of matrices of skew polynomials. ISSAC 2002: 8-15 - 2001
- [c4]Howard Cheng, George Labahn:
Computing all factorizations in ***. ISSAC 2001: 64-71 - 2000
- [j3]Howard Cheng, Xiaobo Li:
Partial encryption of compressed images and videos. IEEE Trans. Signal Process. 48(8): 2439-2451 (2000) - [c3]Howard Cheng, Eugene V. Zima:
On accelerated methods to evaluate sums of products of rational numbers. ISSAC 2000: 54-61
1990 – 1999
- 1998
- [j2]Joseph Modayil, Howard Cheng, Xiaobo Li:
An improved piecewise approximation algorithm for image compression. Pattern Recognit. 31(8): 1179-1190 (1998) - 1997
- [j1]Xiaobo Li, Jason Knipe, Howard Cheng:
Image compression and encryption using tree structures. Pattern Recognit. Lett. 18(11-13): 1253-1259 (1997) - [c2]Joseph Modayil, Howard Cheng, Xiaobo Li:
Experiments in Simple One-Dimensional Lossy Image Compression Schemes. ICMCS 1997: 614-615 - 1996
- [c1]Howard Cheng, Xiaobo Li:
On the Application of Image Decomposition to Image Compression. Communications and Multimedia Security 1996: 116-127
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 21:23 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:
