default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMatthew Klimesh
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2012
[j4]Bette Bultena, Matthew Klimesh, Frank Ruskey:
Minimum Area Polyomino Venn Diagrams. J. Comput. Geom. 3(1): 154-167 (2012)- 2009
- [j3]Aaron B. Kiely, Matthew Klimesh:
Exploiting Calibration-Induced Artifacts in Lossless Compression of Hyperspectral Imagery. IEEE Trans. Geosci. Remote. Sens. 47(8-1): 2672-2678 (2009) - 2000
- [j2]John T. Coffey, Matthew Klimesh:
Fundamental limits for information retrieval. IEEE Trans. Inf. Theory 46(7): 2281-2298 (2000) - 1992
- [j1]A. Robert Calderbank, Matthew Klimesh:
Balanced codes and nonequiprobable signaling. IEEE Trans. Inf. Theory 38(3): 1119-1122 (1992)
Conference and Workshop Papers
- 2018
- [c10]Didier Keymeulen, Simon Shin, Jason Riddley, Matthew Klimesh, Aaron B. Kiely, Elliott Liggett, Peter Sullivan, Michael Bernas, Hamid Ghossemi, Greg Flesch, Michael Cheng, Sam Dolinar, David Dolman, Kevin Roth, Chris Holyoake, Ken Crocker, Adam Smith:
High Performance Space Computing with System-on-Chip Instrument Avionics for Space-based Next Generation Imaging Spectrometers (NGIS). AHS 2018: 33-36 - 2010
- [c9]Christopher S. Chang, Matthew Klimesh:
Coding for parallel links to maximize expected decodable-message value. CISS 2010: 1-6 - 2009
- [c8]Nazeeh Aranki, Didier Keymeulen, Alireza Bakhshi, Matthew Klimesh:
Hardware Implementation of Lossless Adaptive and Scalable Hyperspectral Data Compression for Space. AHS 2009: 315-322 - 2008
- [c7]Matthew Klimesh:
Redundancy and optimality of codes for infinite-entropy sources. ISIT 2008: 1949-1953 - 2006
- [c6]Matthew Klimesh, Robert J. McEliece:
Existence, Uniqueness, and Optimality of Sibling-Property Codes for Infinite Sources. ISIT 2006: 2536-2540 - 2004
- [c5]Jon Hamkins, Matthew Klimesh, Robert J. McEliece, Bruce E. Moision:
Capacity of the generalized PPM channel. ISIT 2004: 337 - [c4]Matthew Klimesh:
Entropy measures and catalysis of bipartite quantum state transformations. ISIT 2004: 357 - 2002
- [c3]Aaron B. Kiely, Matthew Klimesh:
Adaptable recursive binary entropy coding technique. Visual Information Processing 2002: 151-165 - 2001
- [c2]Aaron B. Kiely, Matthew Klimesh:
An Adaptable Binary Entropy Coder. Data Compression Conference 2001: 391-400 - 2000
- [c1]Matthew Klimesh:
Optimal Subtractive Dither for Near-Lossless Compression. Data Compression Conference 2000: 223-232
Parts in Books or Collections
- 2006
- [p1]Matthew Klimesh, Aaron B. Kiely, Hua Xie, Nazeeh Aranki:
Spectral Ringing Artifacts in Hyperspectral Image Data Compression. Hyperspectral Data Compression 2006: 379-405
Informal and Other Publications
- 2009
- [i1]Christopher S. Chang, Matthew Klimesh:
Coding for Parallel Links to Maximize Expected Decodable-Message Value. CoRR abs/0901.2143 (2009)
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:58 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:
