516 search results - page 24 / 104 » Sets of k-Independent Strings |
COCO
2004
Springer
14 years 29 days ago
2004
Springer
A source is compressible if we can efficiently compute short descriptions of strings in the support and efficiently recover the strings from the descriptions. A source has high ps...
ICDAR
1999
IEEE
13 years 12 months ago
1999
IEEE
This paper introduces a framework for clarifying and formalizing the duplicate document detection problem. Four distinct models are presented, each with a corresponding algorithm ...
ICDE
2009
IEEE
14 years 9 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...
FOCS
2009
IEEE
13 years 11 months ago
2009
IEEE
Given a set D = {d1, d2, ..., dD} of D strings of total length n, our task is to report the "most relevant" strings for a given query pattern P. This involves somewhat mo...
SIGMOD
2008
ACM
14 years 7 months ago
2008
ACM
Approximate queries on a collection of strings are important in many applications such as record linkage, spell checking, and Web search, where inconsistencies and errors exist in...