Sciweavers

715 search results - page 3 / 143
» Second step algorithms in the Burrows-Wheeler compression al...
Sort
View
CCP
2011
92views more  CCP 2011»
12 years 6 months ago
Backwards Search in Context Bound Text Transformations
—The Burrows-Wheeler Transform (BWT) is the basis for many of the most effective compression and selfindexing methods used today. A key to the versatility of the BWT is the abili...
Matthias Petri, Gonzalo Navarro, J. Shane Culpeppe...
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 ...
CGO
2003
IEEE
13 years 11 months ago
Code Optimization for Code Compression
With the emergence of software delivery platforms such as Microsoft’s .NET, reduced size of transmitted binaries has become a very important system parameter strongly affecting ...
Milenko Drinic, Darko Kirovski, Hoi Vo
CHES
2005
Springer
107views Cryptology» more  CHES 2005»
13 years 11 months ago
A New Baby-Step Giant-Step Algorithm and Some Applications to Cryptanalysis
We describe a new variant of the well known Baby-Step Giant-Step algorithm in the case of some discrete logarithms with a special structure. More precisely, we focus on discrete lo...
Jean-Sébastien Coron, David Lefranc, Guilla...
DATESO
2009
158views Database» more  DATESO 2009»
13 years 4 months ago
Benchmarking Coding Algorithms for the R-tree Compression
Multi-dimensional data structures have been widely applied in many data management fields. Spatial data indexing is their natural application, however there are many applications i...
Jirí Walder, Michal Krátký, R...