17 search results - page 1 / 4 » Improving the Performance of M-Tree Family by Nearest-Neighb... |
ADBIS
2007
Springer
13 years 11 months ago
2007
Springer
The M-tree and its variants have been proved to provide an efficient similarity search in database environments. In order to further improve their performance, in this paper we pro...
GEOINFORMATICA
2007
13 years 4 months ago
2007
Nearest Neighbor (NN) search has been in the core of spatial and spatiotemporal database research during the last decade. The literature on NN query processing algorithms so far d...
COMPGEOM
2006
ACM
13 years 11 months ago
2006
ACM
Given a metric space (X, dX), c ≥ 1, r > 0, and p, q ∈ [0, 1], a distribution over mappings H : X → N is called a (r, cr, p, q)-sensitive hash family if any two points in...
TIP
2010
13 years 3 months ago
2010
—In increasingly many cases of interest in computer vision and pattern recognition, one is often confronted with the situation where data size is very large. Usually, the labels ...
BMCBI
2011
12 years 8 months ago
2011
Background: The search for cluster structure in microarray datasets is a base problem for the so-called “-omic sciences”. A difficult problem in clustering is how to handle da...