242 search results - page 3 / 49 » Fast Indexes and Algorithms for Set Similarity Selection Que... |
DEBU
2010
13 years 7 months ago
2010
Consider a universe of tokens, each of which is associated with a weight, and a database consisting of strings that can be represented as subsets of these tokens. Given a query st...
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...
ICDE
2006
IEEE
14 years 8 months ago
2006
IEEE
Graphs have become popular for modeling structured data. As a result, graph queries are becoming common and graph indexing has come to play an essential role in query processing. ...
ICIP
2008
IEEE
14 years 1 months ago
2008
IEEE
This paper addresses the shape-based segmentation problem using level sets. In particular, we propose a fast algorithm to solve the piece-wise constant Chan-Vese segmentation mode...
BIBE
2003
IEEE
14 years 20 days ago
2003
IEEE
We present a multi-dimensional indexing approach for fast sequence similarity search in DNA and protein databases. In particular, we propose effective transformations of subsequen...