Sciweavers

229 search results - page 23 / 46
» Semi-Lossless Text Compression
Sort
View
ICIP
2002
IEEE
14 years 9 months ago
Low complexity guaranteed fit compound document compression
We propose a new, very low complexity, single-pass, algorithm for compression of continuous tone compound documents, known as GRAFIT (GuaRAnteed FIT) that can guarantee a minimum ...
Debargha Mukherjee, Christos Chrysafis, Amir Said
CPM
2001
Springer
111views Combinatorics» more  CPM 2001»
13 years 12 months ago
Multiple Pattern Matching Algorithms on Collage System
Abstract. Compressed pattern matching is one of the most active topics in string matching. The goal is to find all occurrences of a pattern in a compressed text without decompress...
Takuya Kida, Tetsuya Matsumoto, Masayuki Takeda, A...
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
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...
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...