22 search results - page 1 / 5 » Sublinear Algorithms for Approximating String Compressibilit... |
APPROX
2007
Springer
13 years 10 months ago
2007
Springer
We raise the question of approximating the compressibility of a string with respect to a fixed compression scheme, in sublinear time. We study this question in detail for two popu...
STOC
2003
ACM
14 years 4 months ago
2003
ACM
We show how to determine whether the edit distance between two given strings is small in sublinear time. Specifically, we present a test which, given two n-character strings A and...
IPPS
2003
IEEE
13 years 10 months ago
2003
IEEE
Today, in many practical E-Commerce systems, the real stored data usually are short strings, such as names, addresses, or other information. Searching data within these short stri...
SODA
2010
ACM
13 years 3 months ago
2010
ACM
We give near-tight bounds for estimating the edit distance between two non-repetitive strings (Ulam distance) with constant approximation, in sub-linear time. For two strings of l...
IJFCS
2006
13 years 4 months ago
2006
Music sequences can be treated as texts in order to perform music retrieval tasks on them. However, the text search problems that result from this modeling are unique to music retr...