239 search results - page 1 / 48 » Fast Prefix Code Processing |
ITCC
2003
IEEE
13 years 10 months ago
2003
IEEE
As large main memory becomes more and more available at reasonable prices, processing speed of large data sets becomes more important than reducing main memory usage of internal d...
ISAAC
1995
Springer
13 years 8 months ago
1995
Springer
Abstract. The minimum-redundancy prefix codeproblem is to deter
DCC
2010
IEEE
13 years 8 months ago
2010
IEEE
This paper improves the Tagged Suboptimal Codes (TSC) compression scheme in several ways. We show how to process the TSC as a universal code. We introduce the TSCk as a family of ...
SOFSEM
2010
Springer
13 years 2 months ago
2010
Springer
It is well-known that, given a probability distribution over n characters, in the worst case it takes (n log n) bits to store a prefix code with minimum expected codeword length. H...
NETWORKING
2008
13 years 6 months ago
2008
Due to the increasing size of IP routing table and the growing rate of their lookups, many algorithms are introduced to achieve the required speed in table search and update or opt...