Sciweavers

327 search results - page 1 / 66
» Algorithms for infinite huffman-codes
Sort
View
SPIRE
2001
Springer
13 years 9 months ago
Adding Security to Compressed Information Retrieval Systems
Word-based Huffman coding has widespread use in information retrieval systems. Besides its compressing power, it also enables the implementation of both indexing and searching sch...
Ruy Luiz Milidiú, C. Gomes de Mello, J. Fer...
GEM
2008
13 years 6 months ago
Better Huffman Coding via Genetic Algorithm
Abstract--We present an approach to compress arbitrary files using a Huffman-like prefix-free code generated through the use of a genetic algorithm, thus requiring no prior knowled...
Cody Boisclair, Markus Wagner
STOC
2002
ACM
96views Algorithms» more  STOC 2002»
14 years 5 months ago
Huffman coding with unequal letter costs
Mordecai J. Golin, Claire Kenyon, Neal E. Young
DCC
2008
IEEE
14 years 4 months ago
Huffman Coding with Non-sorted Frequencies
Abstract. A standard way of implementing Huffman's optimal code construction algorithm is by using a sorted sequence of frequencies. Several aspects of the algorithm are inves...
Shmuel Tomi Klein, Dana Shapira