10 search results - page 2 / 2 » Tight Bounds for String Reconstruction Using Substring Queri... |
SWAT
2004
Springer
13 years 11 months ago
2004
Springer
In this paper, we investigate the test set problem and its variations that appear in a variety of applications. In general, we are given a universe of objects to be “distinguish...
FOCS
2006
IEEE
14 years 9 days ago
2006
IEEE
We investigate the optimality of (1+ )-approximation algorithms obtained via the dimensionality reduction method. We show that: • Any data structure for the (1 + )-approximate n...
ICALP
2005
Springer
13 years 11 months ago
2005
Springer
We prove new lower bounds for locally decodable codes and private information retrieval. We show that a 2-query LDC encoding nbit strings over an ℓ-bit alphabet, where the decode...
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...
VLDB
2003
ACM
14 years 6 months ago
2003
ACM
Due to their expressive power, Regular Expressions (REs) are quickly becoming an integral part of language specifications for several important application scenarios. Many of thes...