Sciweavers

837 search results - page 4 / 168
» Dynamic Burrows-Wheeler Transform
Sort
View
DCC
2001
IEEE
14 years 5 months ago
LIPT: A Reversible Lossless Text Transform to Improve Compression Performance
Lossless compression researchers have developed highly sophisticated approaches, such as Huffman encoding, arithmetic encoding, the Lempel-Ziv family, Dynamic Markov Compression (D...
Fauzia S. Awan, Nan Zhang 0005, Nitin Motgi, Raja ...
CAI
2007
Springer
14 years 3 hour ago
Sturmian and Episturmian Words
Abstract. This survey paper contains a description of some recent results concerning Sturmian and episturmian words, with particular emphasis on central words. We list fourteen cha...
Jean Berstel
VLDB
2007
ACM
117views Database» more  VLDB 2007»
14 years 6 months ago
RadixZip: Linear-Time Compression of Token Streams
RadixZip is a block compression technique for token streams. It introduces RadixZip Transform, a linear time algorithm that rearranges bytes using a technique inspired by radix so...
Binh Vo, Gurmeet Singh Manku
DCC
2004
IEEE
14 years 5 months ago
Fast Compression with a Static Model in High-Order Entropy
We report on a simple encoding format called wzip for decompressing block-sorting transforms, such as the Burrows-Wheeler Transform (BWT). Our compressor uses the simple notions o...
Luca Foschini, Roberto Grossi, Ankur Gupta, Jeffre...
CPM
2007
Springer
73views Combinatorics» more  CPM 2007»
13 years 9 months ago
Move-to-Front, Distance Coding, and Inversion Frequencies Revisited
Move-to-Front, Distance Coding and Inversion Frequencies are three simple and effective techniques used to process the output of the Burrows-Wheeler Transform. In this paper we pr...
Travis Gagie, Giovanni Manzini