51 search results - page 7 / 11 » A Cost Model For Nearest Neighbor Search in High-Dimensional... |
ICDE
2006
IEEE
14 years 8 months ago
2006
IEEE
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...
ICDE
2009
IEEE
14 years 8 months ago
2009
IEEE
This demonstration program presents the V*-kNN algorithm, an efficient algorithm to process moving k nearest neighbor queries (MkNN). The V*-kNN algorithm is based on a safe-region...
TMM
2002
13 years 6 months ago
2002
This paper presents the rudiments of a theory of schema design for databases containing high dimensional features of the type used for describing multimedia data. We introduce a mo...
PVLDB
2010
13 years 5 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
2008
ACM
14 years 6 months ago
2008
ACM
Due to the well-known dimensionality curse problem, search in a high-dimensional space is considered as a "hard" problem. In this paper, a novel symmetrical encoding-bas...