14 search results - page 1 / 3» Using the k-Nearest Neighbor Graph for Proximity Searching i... |

SPIRE

2005

Springer

14 years 1 months ago
2005

Springer

Proximity searching consists in retrieving from a database, objects that are close to a query. For this type of searching problem, the most general model is the metric space, where...

PVLDB

2010

13 years 6 months ago
2010

Complex networks, such as biological, social, and communication networks, often entail uncertainty, and thus, can be modeled as probabilistic graphs. Similar to the problem of sim...

EDBT

2010

ACM

13 years 10 months ago
2010

ACM

The availability of indoor positioning renders it possible to deploy location-based services in indoor spaces. Many such services will beneﬁt from the efﬁcient support for k n...

BTW

2007

Springer

13 years 12 months ago
2007

Springer

: 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...

ICALP

1992

Springer

14 years 2 days ago
1992

Springer

The "nearest neighbor" relation, or more generally the "k nearest neighbors" relation, defined for a set of points in a metric space, has found many uses in co...