Sciweavers

314 search results - page 47 / 63
» Arithmetic Coding Revisited
Sort
View
POPL
2007
ACM
15 years 10 months ago
Preferential path profiling: compactly numbering interesting paths
Path profiles provide a more accurate characterization of a program's dynamic behavior than basic block or edge profiles, but are relatively more expensive to collect. This h...
Kapil Vaswani, Aditya V. Nori, Trishul M. Chilimbi
DIALM
2007
ACM
178views Algorithms» more  DIALM 2007»
15 years 1 months ago
Near-Optimal Compression of Probabilistic Counting Sketches for Networking Applications
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
Björn Scheuermann, Martin Mauve
CAD
2005
Springer
14 years 9 months ago
Lossless compression of predicted floating-point geometry
The size of geometric data sets in scientific and industrial applications is constantly increasing. Storing surface or volume meshes in standard uncompressed formats results in la...
Martin Isenburg, Peter Lindstrom, Jack Snoeyink
DCC
2007
IEEE
15 years 9 months ago
A Simple Statistical Algorithm for Biological Sequence Compression
This paper introduces a novel algorithm for biological sequence compression that makes use of both statistical properties and repetition within sequences. A panel of experts is ma...
Minh Duc Cao, Trevor I. Dix, Lloyd Allison, Chris ...
DCC
2006
IEEE
15 years 9 months ago
Low-Complexity Compression of Short Messages
We describe a low-complexity scheme for lossless compression of short text messages. The method uses arithmetic coding and a specific statistical context model for prediction of s...
Stephan Rein, Clemens Gühmann, Frank H. P. Fi...