Sciweavers

134 search results - page 5 / 27
» The fractal neighbor distance measure
Sort
View
NETWORK
2007
167views more  NETWORK 2007»
13 years 10 months ago
Sensor Localization under Limited Measurement Capabilities
If we abstract a sensor network as a network graph consisting of vertices and edges, where vertices represent sensor nodes and edges represent distance measurements between neighbo...
Chen Wang, Li Xiao
FOCS
1999
IEEE
14 years 3 months ago
Approximate Nearest Neighbor Algorithms for Hausdorff Metrics via Embeddings
Hausdorff metrics are used in geometric settings for measuring the distance between sets of points. They have been used extensively in areas such as computer vision, pattern recog...
Martin Farach-Colton, Piotr Indyk
ICML
2007
IEEE
14 years 11 months ago
Neighbor search with global geometry: a minimax message passing algorithm
Neighbor search is a fundamental task in machine learning, especially in classification and retrieval. Efficient nearest neighbor search methods have been widely studied, with the...
Kye-Hyeon Kim, Seungjin Choi
ICMCS
2009
IEEE
205views Multimedia» more  ICMCS 2009»
13 years 8 months ago
Bregman vantage point trees for efficient nearest Neighbor Queries
Nearest Neighbor (NN) retrieval is a crucial tool of many computer vision tasks. Since the brute-force naive search is too time consuming for most applications, several tailored d...
Frank Nielsen, Paolo Piro, Michel Barlaud
ICPR
2002
IEEE
14 years 12 months ago
An Evaluation of the WPE Algorithm Using Tangent Distance
Weighting Prototype Editing (WPE) is a novel approach to edit a given set of prototypes so that the resulting set can outperform the original one in terms of the Nearest Neighbor ...
Roberto Paredes Palacios, Enrique Vidal, Daniel Ke...