77 search results - page 9 / 16 » High-rate codes that are linear in space and time |
CORR
2008
Springer
14 years 11 months ago
2008
Springer
A method is presented for constructing a Tunstall code that is linear time in the number of output items. This is an improvement on the state of the art for non-Bernoulli sources, ...
104
click to vote
APLAS
2010
ACM
14 years 9 months ago
2010
ACM
Live heap space analyses have so far been concerned with the standard sequential programming model. However, that model is not very well suited for embedded real-time systems, wher...
104
click to vote
CSCLP
2007
Springer
15 years 5 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...
DCC
2009
IEEE
16 years 8 days ago
2009
IEEE
We present a linear time and space suffix array (SA) construction algorithm called the SA-IS algorithm. The SA-IS algorithm is novel because of the LMS-substrings used for the pro...
ADVIS
2004
Springer
15 years 3 months ago
2004
Springer
In this paper, we introduce a new approach to adaptive coding which utilizes Stochastic Learning-based Weak Estimation (SLWE) techniques to adaptively update the probabilities of t...