19 search results - page 2 / 4 » The A-tree: An Index Structure for High-Dimensional Spaces U... |
SIGMOD
2002
ACM
14 years 5 months ago
2002
ACM
Applications like multimedia retrieval require efficient support for similarity search on large data collections. Yet, nearest neighbor search is a difficult problem in high dimen...
KDD
2006
ACM
14 years 6 months ago
2006
ACM
Statistics on networks have become vital to the study of relational data drawn from areas such as bibliometrics, fraud detection, bioinformatics, and the Internet. Calculating man...
SIGMOD
2001
ACM
14 years 5 months ago
2001
ACM
Similarity search in large time series databases has attracted much research interest recently. It is a difficult problem because of the typically high dimensionality of the data....
ECIR
2008
Springer
13 years 7 months ago
2008
Springer
Word space models, in the sense of vector space models built on distributional data taken from texts, are used to model semantic relations between words. We argue that the high dim...
PODS
2009
ACM
14 years 6 months ago
2009
ACM
Let be a finite, ordered alphabet, and consider a string x = x1x2 . . . xn n . A secondary index for x answers alphabet range queries of the form: Given a range [al, ar] , retu...