11716 search results - page 393 / 2344 » Computable symbolic dynamics |
179
click to vote
DCC
2008
IEEE
16 years 6 months ago
2008
IEEE
Recent advances in compressed data structures have led to the new concept of self-indexing; it is possible to represent a sequence of symbols compressed in a form that enables fas...
147
click to vote
DCC
2007
IEEE
16 years 6 months ago
2007
IEEE
We consider grammar based text compression with longest first substitution, where non-overlapping occurrences of a longest repeating substring of the input text are replaced by a ...
176
click to vote
DCC
2006
IEEE
16 years 6 months ago
2006
IEEE
A covering array CA(N; t, k, v) is an N ? k array such that every N ? t sub-array contains all t-tuples from v symbols at least once, where t is the strength of the array. Coverin...
179
click to vote
DCC
2006
IEEE
16 years 6 months ago
2006
IEEE
Lossless compression is studied for pairs of independent integer-valued symbols emitted by a source with a geometric probability distribution of parameter q (0, 1). Optimal prefix...
133
Voted
DCC
2006
IEEE
16 years 6 months ago
2006
IEEE
We consider the problem of compressibility of protein sequences. Based on an observed genome-scale long-range correlation in concatenated protein sequences from different organism...