22 search results - page 3 / 5 » Sublinear Algorithms for Approximating String Compressibilit... |
FUIN
2006
13 years 5 months ago
2006
We consider approximate pattern matching in natural language text. We use the words of the text as the alphabet, instead of the characters as in traditional string matching approac...
CPM
1999
Springer
13 years 9 months ago
1999
Springer
The study of approximately periodic strings is relevant to diverse applications such as molecular biology, data compression, and computer-assisted music analysis. Here we study di...
ICDE
2009
IEEE
14 years 7 months ago
2009
IEEE
Abstract-- Answering approximate queries on string collections is important in applications such as data cleaning, query relaxation, and spell checking, where inconsistencies and e...
SIGIR
1998
ACM
13 years 9 months ago
1998
ACM
Abstract We present a fast compression and decompression scheme for natural language texts that allows e cient and exible string matching by searching the compressed text directly....
COMPGEOM
2011
ACM
12 years 9 months ago
2011
ACM
We propose a framework for compressive sensing of images with local geometric features. Specifically, let x ∈ RN be an N-pixel image, where each pixel p has value xp. The image...