57 search results - page 11 / 12 » On-Line Approximate String Matching with Bounded Errors |
CIKM
2008
Springer
13 years 8 months ago
2008
Springer
Inverted indexes using sequences of characters (n-grams) as terms provide an error-resilient and language-independent way to query for arbitrary substrings and perform approximate...
STOC
2003
ACM
14 years 6 months ago
2003
ACM
We construct binary codes for fingerprinting. Our codes for n users that are -secure against c pirates have length O(c2 log(n/ )). This improves the codes proposed by Boneh and Sh...
ALT
2002
Springer
14 years 3 months ago
2002
Springer
Abstract. We consider a problem that is related to the “Universal Encoding Problem” from information theory. The basic goal is to find rules that map “partial information”...
PODS
2009
ACM
14 years 6 months ago
2009
ACM
We consider the the problem of tracking heavy hitters and quantiles in the distributed streaming model. The heavy hitters and quantiles are two important statistics for characteri...
FOCS
2008
IEEE
14 years 24 days ago
2008
IEEE
Abstract— We consider the approximate sparse recovery problem, where the goal is to (approximately) recover a highdimensional vector x ∈ Rn from its lower-dimensional sketch Ax...