39 search results - page 6 / 8 » Fast and Compact Prefix Codes |
SIGSOFT
2005
ACM
14 years 9 months ago
2005
ACM
We present Arithmetic Program Paths, a novel, efficient way to compress program control-flow traces that reduces program bit traces to less than a fifth of their original size whi...
ICMCS
2006
IEEE
14 years 2 months ago
2006
IEEE
Audio Fingerprints (AFP’s) are compact, content-based representations of audio signals used to measure distances among them. An AFP has to be small, fast computed and robust to ...
CODES
2005
IEEE
14 years 2 months ago
2005
IEEE
Scripting is a powerful, high-level, cross-platform, dynamic, easy way of composing software modules as black boxes. Unfortunately, the high runtime overhead has prevented scripti...
DCC
2002
IEEE
14 years 8 months ago
2002
IEEE
We present a technique designed aiming to improve the compression of the Edgebreaker CLERS string for large and regular meshes, where regularity is understood as the compactness o...
CSCLP
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. The union-find algorithm can be seen as solving simple equations between variables or constants. With a few lines of code change, we generalise its implementation in CHR...