12 search results - page 2 / 3 » Maximal metric margin partitioning for similarity search ind... |
ADC
2003
Springer
13 years 10 months ago
2003
Springer
In this paper, we propose a new metric index, called M+ -tree, which is a tree dynamically organized for large datasets in metric spaces. The proposed M+ -tree takes full advantag...
ICDE
2000
IEEE
14 years 6 months ago
2000
IEEE
In high-dimensional and complex metric spaces, determining the nearest neighbor (NN) of a query object ? can be a very expensive task, because of the poor partitioning operated by...
VRST
2009
ACM
13 years 12 months ago
2009
ACM
For the convenient reuse of large-scale 3D motion capture data, browsing and searching methods for the data should be explored. In this paper, an efficient indexing and retrieval...
SISAP
2010
IEEE
13 years 3 months ago
2010
IEEE
The efficient similarity search in metric spaces is usually based on several low-level partitioning principles, which allow filtering of non-relevant objects during the search. I...
VLDB
2007
ACM
13 years 11 months ago
2007
ACM
In this paper we observe that k-anonymizing a data set is strikingly similar to building a spatial index over the data set, so similar in fact that classical spatial indexing tech...