170 search results - page 19 / 34 » Algorithms on Compressed Strings and Arrays |
CSB
2004
IEEE
15 years 1 months ago
2004
IEEE
We propose derivative Boyer-Moore (d-BM), a new compressed pattern matching algorithm in DNA sequences. This algorithm is based on the BoyerMoore method, which is one of the most ...
83
Voted
ICIP
2000
IEEE
15 years 11 months ago
2000
IEEE
A new approach to multichannel image compression is introduced where the intra- and cross-band correlations are jointly exploited in a surprisingly simple yet very effective manner...
70
Voted
DCC
2010
IEEE
15 years 4 months ago
2010
IEEE
We present a technique that compresses a string w by enumerating all the substrings of w. The substrings are enumerated from the shortest to the longest and in lexicographic order...
ASAP
2007
IEEE
15 years 4 months ago
2007
IEEE
Entropy encoding and decoding is a crucial part of any multimedia system that can be highly demanding in terms of computing power. Hardware implementation of typical compression a...
135
click to vote
DCC
2011
IEEE
14 years 4 months ago
2011
IEEE
Larsson and Moffat’s RePair algorithm is generalized from strings to trees. The new algorithm (TreeRePair) produces straight-line linear context-free tree (SLT) grammars which a...