Sciweavers

229 search results - page 18 / 46
» Semi-Lossless Text Compression
Sort
View
SCCC
1998
IEEE
13 years 11 months ago
Parallel Generation of Inverted Files for Distributed Text Collections
We present a scalable algorithm for the parallel computation of inverted files for large text collections. The algorithm takes into account an environment of a high bandwidth netw...
Berthier A. Ribeiro-Neto, Joao Paulo Kitajima, Gon...
CCP
2011
92views more  CCP 2011»
12 years 7 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...
SPIRE
1998
Springer
13 years 11 months ago
An Experiment Stemming Non-Traditional Text
Stemming is a technique which aims to extract common suffixes of words. Thus, words which are literally differhave a common stem, may be abstracted by their common stem. The under...
Mario A. Nascimento, Adriano C. R. da Cunha
IJAIT
2002
122views more  IJAIT 2002»
13 years 7 months ago
Comparing Keyword Extraction Techniques for WEBSOM Text Archives
The WEBSOM methodology for building very large text archives has a very slow method for extracting meaningful unit labels. This is because the method computes for the relative fre...
Arnulfo P. Azcarraga, Teddy N. Yap Jr., Tat-Seng C...
APPROX
2004
Springer
89views Algorithms» more  APPROX 2004»
13 years 11 months ago
The Sketching Complexity of Pattern Matching
Abstract. We address the problems of pattern matching and approximate pattern matching in the sketching model. We show that it is impossible to compress the text into a small sketc...
Ziv Bar-Yossef, T. S. Jayram, Robert Krauthgamer, ...