Sciweavers

34 search results - page 4 / 7
» Finding Data Broadness Via Generalized Nearest Neighbors
Sort
View
GIS
2005
ACM
16 years 4 months ago
Two ellipse-based pruning methods for group nearest neighbor queries
Group nearest neighbor (GNN) queries are a relatively new type of operations in spatial database applications. Different from a traditional kNN query which specifies a single quer...
Hongga Li, Hua Lu, Bo Huang, Zhiyong Huang
CIVR
2008
Springer
204views Image Analysis» more  CIVR 2008»
15 years 5 months ago
Image clustering based on a shared nearest neighbors approach for tagged collections
Browsing and finding pictures in large-scale and heterogeneous collections is an important issue, most particularly for online photo sharing applications. Since such services know...
Pierre-Alain Moëllic, Jean-Emmanuel Haugeard,...
ICDE
2006
IEEE
135views Database» more  ICDE 2006»
16 years 5 months ago
Reverse Nearest Neighbors Search in Ad-hoc Subspaces
Given an object q, modeled by a multidimensional point, a reverse nearest neighbors (RNN) query returns the set of objects in the database that have q as their nearest neighbor. I...
Man Lung Yiu, Nikos Mamoulis
STOC
2006
ACM
138views Algorithms» more  STOC 2006»
16 years 4 months ago
Searching dynamic point sets in spaces with bounded doubling dimension
We present a new data structure that facilitates approximate nearest neighbor searches on a dynamic set of points in a metric space that has a bounded doubling dimension. Our data...
Richard Cole, Lee-Ad Gottlieb
BTW
2007
Springer
183views Database» more  BTW 2007»
15 years 7 months ago
Efficient Reverse k-Nearest Neighbor Estimation
: The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, has received increasing a...
Elke Achtert, Christian Böhm, Peer Kröge...