Sciweavers

19 search results - page 2 / 4
» Dynamic lightweight text compression
Sort
View
CPM
2006
Springer
164views Combinatorics» more  CPM 2006»
14 years 1 months ago
Dynamic Entropy-Compressed Sequences and Full-Text Indexes
Veli Mäkinen, Gonzalo Navarro
ESA
2009
Springer
143views Algorithms» more  ESA 2009»
14 years 4 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
2001
IEEE
14 years 9 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 ...
PERCOM
2009
ACM
14 years 4 months ago
Adaptive Linear Filtering Compression on Realtime Sensor Networks
Abstract—We present a lightweight lossless compression algorithm for realtime sensor networks. Our proposed Adaptive Linear Filtering Compression (ALFC) algorithm performs predic...
Aaron B. Kiely, Mingsen Xu, Wen-Zhan Song, Renjie ...
ICDE
2010
IEEE
288views Database» more  ICDE 2010»
14 years 9 months ago
Fast In-Memory XPath Search using Compressed Indexes
A large fraction of an XML document typically consists of text data. The XPath query language allows text search via the equal, contains, and starts-with predicates. Such predicate...
Diego Arroyuelo, Francisco Claude, Sebastian Manet...