Sciweavers

27 search results - page 5 / 6
» Syllable-Based Burrows-Wheeler Transform
Sort
View
ICC
2007
IEEE
129views Communications» more  ICC 2007»
13 years 11 months ago
Source Controlled Modulation Scheme for Sources with Memory
— Given an AWGN channel, we look at the problem of designing a source controlled binary antipodal signaling system for transmitting blocks of binary symbols generated either by a...
Pedro M. Crespo, Estibaliz Loyo, Javier Del Ser, C...
ESA
2009
Springer
143views Algorithms» more  ESA 2009»
13 years 11 months ago
On Optimally Partitioning a Text to Improve Its Compression
In this paper we investigate the problem of partitioning an input string T in such a way that compressing individually its parts via a basecompressor C gets a compressed output th...
Paolo Ferragina, Igor Nitto, Rossano Venturini
DCC
1998
IEEE
13 years 9 months ago
The Context Trees of Block Sorting Compression
Abstract. The Burrows-Wheeler transform (BWT) and block sorting compression are closely related to the context trees of PPM. The usual approach of treating BWT as merely a permutat...
N. Jesper Larsson
IJFCS
2006
83views more  IJFCS 2006»
13 years 5 months ago
A Simple Alphabet-independent Fm-index
Abstract. We design a succinct full-text index based on the idea of Huffmancompressing the text and then applying the Burrows-Wheeler transform over it. The resulting structure can...
Szymon Grabowski, Gonzalo Navarro, Rafal Przywarsk...
FCCM
2011
IEEE
311views VLSI» more  FCCM 2011»
12 years 9 months ago
String Matching in Hardware Using the FM-Index
—String matching is a ubiquitous problem that arises in a wide range of applications in computing, e.g., packet routing, intrusion detection, web querying, and genome analysis. D...
Edward Fernandez, Walid Najjar, Stefano Lonardi