Sciweavers

501 search results - page 50 / 101
» Kernel Nearest Neighbor Algorithm
Sort
View
ESANN
2007
13 years 9 months ago
Estimation of tangent planes for neighborhood graph correction
Local algorithms for non-linear dimensionality reduction [1], [2], [3], [4], [5] and semi-supervised learning algorithms [6], [7] use spectral decomposition based on a nearest neig...
Karina Zapien Arreola, Gilles Gasso, Stépha...
ICASSP
2011
IEEE
13 years 4 months ago
Searching in one billion vectors: re-rank with source coding
Recent indexing techniques inspired by source coding have been shown successful to index billions of high-dimensional vectors in memory. In this paper, we propose an approach that ...
Hervé Jégou and Romain Tavenard and Matthijs Dou...
SODA
2000
ACM
127views Algorithms» more  SODA 2000»
13 years 9 months ago
Dimensionality reduction techniques for proximity problems
In this paper we give approximation algorithms for several proximity problems in high dimensional spaces. In particular, we give the rst Las Vegas data structure for (1 + )-neares...
Piotr Indyk
SSD
1995
Springer
97views Database» more  SSD 1995»
13 years 11 months ago
Ranking in Spatial Databases
Abstract. An algorithm for ranking spatial objects according to increasing distance from a query object is introduced and analyzed. The algorithm makes use of a hierarchical spatia...
Gísli R. Hjaltason, Hanan Samet
KES
2004
Springer
14 years 1 months ago
Epistemic Logic and Planning
Artificial Intelligence algorithms can be divided into two groups according to the type of problems they solve. Knowledge-intensive domains contain explicit knowledge, whereas know...
Shahin Maghsoudi, Ian Watson