Sciweavers

247 search results - page 4 / 50
» Scaling up all pairs similarity search
Sort
View
SSDBM
2010
IEEE
220views Database» more  SSDBM 2010»
13 years 10 months ago
Prefix Tree Indexing for Similarity Search and Similarity Joins on Genomic Data
Similarity search and similarity join on strings are important for applications such as duplicate detection, error detection, data cleansing, or comparison of biological sequences....
Astrid Rheinländer, Martin Knobloch, Nicky Ho...
ADBIS
2009
Springer
162views Database» more  ADBIS 2009»
13 years 9 months ago
Efficient Set Similarity Joins Using Min-prefixes
Identification of all objects in a dataset whose similarity is not less than a specified threshold is of major importance for management, search, and analysis of data. Set similari...
Leonardo Ribeiro, Theo Härder
ICDE
2008
IEEE
139views Database» more  ICDE 2008»
14 years 6 days ago
Compact Similarity Joins
— Similarity joins have attracted significant interest, with applications in Geographical Information Systems, astronomy, marketing analyzes, and anomaly detection. However, all...
Brent Bryan, Frederick Eberhardt, Christos Falouts...
ICIP
2010
IEEE
13 years 3 months ago
Fast geometric re-ranking for image-based retrieval
We present a fast and efficient geometric re-ranking method that can be incorporated in a feature based image-based retrieval system that utilizes a Vocabulary Tree (VT). We form ...
Sam S. Tsai, David Chen, Gabriel Takacs, Vijay Cha...
PODS
2005
ACM
127views Database» more  PODS 2005»
14 years 5 months ago
FTW: fast similarity search under the time warping distance
Time-series data naturally arise in countless domains, such as meteorology, astrophysics, geology, multimedia, and economics. Similarity search is very popular, and DTW (Dynamic T...
Yasushi Sakurai, Masatoshi Yoshikawa, Christos Fal...