Sciweavers

233 search results - page 2 / 47
» An Investigation of Practical Approximate Nearest Neighbor A...
Sort
View
ICDE
2012
IEEE
343views Database» more  ICDE 2012»
12 years 1 months ago
Bi-level Locality Sensitive Hashing for k-Nearest Neighbor Computation
We present a new Bi-level LSH algorithm to perform approximate k-nearest neighbor search in high dimensional spaces. Our formulation is based on a two-level scheme. In the first ...
Jia Pan, Dinesh Manocha
CCCG
2006
14 years 7 days ago
(Approximate) Conic Nearest Neighbors and the induced Voronoi Diagram
For a given point set in Euclidean space we consider the problem of finding (approximate) nearest neighbors of a query point but restricting only to points that lie within a fixed...
Stefan Funke, Theocharis Malamatos, Domagoj Matije...
ICDE
2010
IEEE
295views Database» more  ICDE 2010»
14 years 5 months ago
K nearest neighbor queries and kNN-Joins in large relational databases (almost) for free
— Finding the k nearest neighbors (kNN) of a query point, or a set of query points (kNN-Join) are fundamental problems in many application domains. Many previous efforts to solve...
Bin Yao, Feifei Li, Piyush Kumar
ICDE
2005
IEEE
156views Database» more  ICDE 2005»
15 years 6 days ago
Reverse Nearest Neighbors in Large Graphs
A reverse nearest neighbor (RNN) query returns the data objects that have a query point as their nearest neighbor (NN). Although such queries have been studied quite extensively in...
Man Lung Yiu, Dimitris Papadias, Nikos Mamoulis, Y...
CIKM
2003
Springer
14 years 4 months ago
High dimensional reverse nearest neighbor queries
Reverse Nearest Neighbor (RNN) queries are of particular interest in a wide range of applications such as decision support systems, profile based marketing, data streaming, docum...
Amit Singh, Hakan Ferhatosmanoglu, Ali Saman Tosun