112 search results - page 6 / 23 » An Approximation Algorithm for Alphabet Indexing Problem |
SIGMOD
2012
ACM
12 years 12 months ago
2012
ACM
Query substitution is an important problem in information retrieval. Much work focuses on how to find substitutes for any given query. In this paper, we study how to efficiently ...
113
click to vote
APPROX
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. We give a (ln n + 1)-approximation for the decision tree (DT) problem. An instance of DT is a set of m binary tests T = (T1, . . . , Tm) and a set of n items X = (X1, . ....
185
click to vote
ICDE
2009
IEEE
15 years 11 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...
BMCBI
2006
14 years 9 months ago
2006
Background: The problem of finding a Shortest Common Supersequence (SCS) of a set of sequences is an important problem with applications in many areas. It is a key problem in biol...
SSDBM
2010
IEEE
15 years 1 months ago
2010
IEEE
Similarity search and similarity join on strings are important for applications such as duplicate detection, error detection, data cleansing, or comparison of biological sequences....