Sciweavers

104 search results - page 2 / 21
» Fast k Nearest Neighbor Search using GPU
Sort
View
WEBDB
2007
Springer
128views Database» more  WEBDB 2007»
13 years 11 months ago
Supporting Range Queries on Web Data Using k-Nearest Neighbor Search
A large volume of geospatial data is available on the web through various forms of applications. However, access to these data is limited by certain types of queries due to restric...
Wan D. Bae, Shayma Alkobaisi, Seon Ho Kim, Sada Na...
TVCG
2010
141views more  TVCG 2010»
13 years 3 months ago
Fast Construction of k-Nearest Neighbor Graphs for Point Clouds
—We present a parallel algorithm for k-nearest neighbor graph construction that uses Morton ordering. Experiments show that our approach has the following advantages over existin...
Michael Connor, Piyush Kumar
ICDE
2010
IEEE
295views Database» more  ICDE 2010»
14 years 11 days 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
2007
IEEE
185views Database» more  ICDE 2007»
14 years 6 months ago
On k-Nearest Neighbor Searching in Non-Ordered Discrete Data Spaces
A k-nearest neighbor (k-NN) query retrieves k objects from a database that are considered to be the closest to a given query point. Numerous techniques have been proposed in the p...
Dashiell Kolbe, Qiang Zhu, Sakti Pramanik
JGTOOLS
2006
199views more  JGTOOLS 2006»
13 years 5 months ago
Fast Approximation of High-Order Voronoi Diagrams and Distance Transforms on the GPU
We present a graphics hardware implementation of the tangent-plane algorithm for computing the kth-order Voronoi diagram of a set of point sites in image space. Correct and effici...
Ian Fischer, Craig Gotsman