Sciweavers

250 search results - page 13 / 50
» Reorganizing compressed text
Sort
View
DCC
2003
IEEE
14 years 7 months ago
A Dictionary-Based Multi-Corpora Text Compression System
In this paper we introduce StarZip, a multi-corpora lossless text compression utility which incorporates StarNT, our newly proposed transform algorithm. StarNT is a dictionary-base...
Weifeng Sun, Nan Zhang 0005, Amar Mukherjee
DCC
1998
IEEE
13 years 11 months ago
Multiple Pattern Matching in LZW Compressed Text
In this paper we address the problem of searching in LZW compressed text directly, and present a new algorithm for finding multiple patterns by simulating the move of the Aho-Cora...
Takuya Kida, Masayuki Takeda, Ayumi Shinohara, Mas...
ICDE
2010
IEEE
288views Database» more  ICDE 2010»
14 years 7 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...
DCC
2004
IEEE
14 years 7 months ago
Semi-Lossless Text Compression
A new notion, that of semi-lossless text compression, is introduced, and its applicability in various settings is investigated. First results suggest that it might be hard to explo...
Yair Kaufman, Shmuel T. Klein
CPM
2000
Springer
175views Combinatorics» more  CPM 2000»
13 years 11 months ago
Approximate String Matching over Ziv-Lempel Compressed Text
Abstract. We present a solution to the problem of performing approximate pattern matching on compressed text. The format we choose is the Ziv-Lempel family, speci cally the LZ78 an...
Juha Kärkkäinen, Gonzalo Navarro, Esko U...