Sciweavers

9886 search results - page 23 / 1978
» Learning Compressible Models
Sort
View
DCC
2010
IEEE
14 years 8 months ago
Neural Markovian Predictive Compression: An Algorithm for Online Lossless Data Compression
This work proposes a novel practical and general-purpose lossless compression algorithm named Neural Markovian Predictive Compression (NMPC), based on a novel combination of Bayesi...
Erez Shermer, Mireille Avigal, Dana Shapira
FSE
2006
Springer
107views Cryptology» more  FSE 2006»
15 years 1 months ago
Some Plausible Constructions of Double-Block-Length Hash Functions
Abstract. In this article, it is discussed how to construct a compression function with 2n-bit output using a component function with n-bit output. The component function is either...
Shoichi Hirose
SCALESPACE
2007
Springer
15 years 3 months ago
Non-negative Sparse Modeling of Textures
This paper presents a statistical model for textures that uses a non-negative decomposition on a set of local atoms learned from an exemplar. This model is described by the varianc...
Gabriel Peyré
DCC
1992
IEEE
15 years 1 months ago
Constructing Word-Based Text Compression Algorithms
Text compression algorithms are normally defined in terms of a source alphabet of 8-bit ASCII codes. We consider choosing to be an alphabet whose symbols are the words of Englis...
R. Nigel Horspool, Gordon V. Cormack
63
Voted
ICPR
2010
IEEE
15 years 3 days ago
Gaze-Motivated Compression of Illumination and View Dependent Textures
—Illumination and view dependent texture provide ample information on the appearance of real materials at the cost of enormous data storage requirements. Hence, past research foc...
Jiri Filip, Michael Haindl, Michael J. Chantler