32 search results - page 1 / 7 » Reference-based indexing for metric spaces with costly dista... |
VLDB
2008
ACM
13 years 4 months ago
2008
ACM
PODS
1998
ACM
13 years 8 months ago
1998
ACM
We consider the problem of estimating CPU (distance computations) and I/O costs for processing range and k-nearest neighbors queries over metric spaces. Unlike the specific case ...
JMLR
2010
12 years 11 months ago
2010
A Hilbert space embedding for probability measures has recently been proposed, with applications including dimensionality reduction, homogeneity testing, and independence testing....
SEBD
1997
13 years 5 months ago
1997
M-tree is a dynamic access method suitable to index generic “metric spaces”, where the function used to compute the distance between any two objects satisfies the positivity, ...
DEXA
2009
Springer
13 years 11 months ago
2009
Springer
Metric access methods (MAMs) serve as a tool for speeding similarity queries. However, all MAMs developed so far are index-based; they need to build an index on a given database. T...