Sciweavers

331 search results - page 23 / 67
» Improved Antidictionary Based Compression
Sort
View
TIT
2010
130views Education» more  TIT 2010»
13 years 4 months ago
Pseudo-random functions and parallelizable modes of operations of a block cipher
This paper considers the construction and analysis of pseudo-random functions (PRFs) with specific reference to modes of operations of a block cipher. In the context of message aut...
Palash Sarkar
DCC
2007
IEEE
14 years 9 months ago
Lossless and Near-Lossless Audio Compression Using Integer-Reversible Modulated Lapped Transforms
We present a simple lossless audio codec, composed of an integer-reversible modulated lapped transform (MLT) followed by a backward-adaptive run-length/Golomb-Rice (RLGR) encoder....
Henrique S. Malvar
AFRIGRAPH
2006
ACM
14 years 3 months ago
Compression of dense and regular point clouds
We present a simple technique for single-rate compression of point clouds sampled from a surface, based on a spanning tree of the points. Unlike previous methods, we predict futur...
Bruce Merry, Patrick Marais, James E. Gain
JMLR
2006
90views more  JMLR 2006»
13 years 9 months ago
Superior Guarantees for Sequential Prediction and Lossless Compression via Alphabet Decomposition
We present worst case bounds for the learning rate of a known prediction method that is based on hierarchical applications of binary context tree weighting (CTW) predictors. A heu...
Ron Begleiter, Ran El-Yaniv
SDM
2009
SIAM
170views Data Mining» more  SDM 2009»
14 years 7 months ago
Optimal Distance Bounds on Time-Series Data.
Most data mining operations include an integral search component at their core. For example, the performance of similarity search or classification based on Nearest Neighbors is ...
Michail Vlachos, Philip S. Yu, Suleyman S. Kozat