Sciweavers

250 search results - page 8 / 50
» Reorganizing compressed text
Sort
View
CONIELECOMP
2005
IEEE
14 years 1 months ago
Approximate Searching on Compressed Text
The approximate searching problem on compressed text tries to find all the matches of a pattern in a compressed text, without decompressing it and considering that the match of th...
Carlos Avendaño Pérez, Claudia Fereg...
DCC
2008
IEEE
14 years 7 months ago
Word-Based Statistical Compressors as Natural Language Compression Boosters
Semistatic word-based byte-oriented compression codes are known to be attractive alternatives to compress natural language texts. With compression ratios around 30%, they allow di...
Antonio Fariña, Gonzalo Navarro, José...
DATESO
2007
85views Database» more  DATESO 2007»
13 years 8 months ago
Improvement of Text Compression Parameters Using Cluster Analysis
Abstract. Several actions are usually performed when document is appended to textual database in information retrieval system. The most frequent actions are compression of the docu...
Jiri Dvorský, Jan Martinovic
DCC
2007
IEEE
14 years 7 months ago
Simple Linear-Time Off-Line Text Compression by Longest-First Substitution
We consider grammar based text compression with longest first substitution, where non-overlapping occurrences of a longest repeating substring of the input text are replaced by a ...
Ryosuke Nakamura, Hideo Bannai, Shunsuke Inenaga, ...
DCC
2005
IEEE
14 years 7 months ago
A Flexible Compressed Text Retrieval System Using a Modified LZW Algorithm
Nan Zhang 0005, Tao Tao, Ravi Vijaya Satya, Amar M...