331 search results - page 3 / 67 » A Clustering Algorithm Based Absorbing Nearest Neighbors |
SPIRE
2005
Springer
14 years 29 days ago
2005
Springer
Proximity searching consists in retrieving from a database, objects that are close to a query. For this type of searching problem, the most general model is the metric space, where...
ICPR
2006
IEEE
14 years 8 months ago
2006
IEEE
In this paper, we propose a new data reduction algorithm that iteratively selects some samples and ignores others that can be absorbed, or represented, by those selected. This alg...
GIS
2006
ACM
14 years 8 months ago
2006
ACM
Given a query point and a collection of spatial features, a multi-type nearest neighbor (MTNN) query finds the shortest tour for the query point such that only one instance of eac...
CVPR
2012
IEEE
11 years 10 months ago
2012
IEEE
We propose an efficient algorithm to find the exact nearest neighbor based on the Euclidean distance for largescale computer vision problems. We embed data points nonlinearly on...
ICPP
2000
IEEE
13 years 12 months ago
2000
IEEE
We consider an efficient distributed algorithm for determining a dominating and absorbant set of vertices (mobile hosts) in a given directed graph that represents an ad hoc wirel...