1042 search results - page 30 / 209 » Fast Population Coding |
159
click to vote
WEA
2007
Springer
16 years 17 days ago
2007
Springer
Given a sequence S of n symbols over some alphabet Σ, we develop a new compression method that is (i) very simple to implement; (ii) provides O(1) time random access to any symbol...
136
Voted
DCC
1993
IEEE
15 years 10 months ago
1993
IEEE
126
Voted
ISAAC
1995
Springer
15 years 10 months ago
1995
Springer
Abstract. The minimum-redundancy prefix codeproblem is to deter
100
Voted
ISCI
2006
15 years 6 months ago
2006