15 search results - page 3 / 3 » On k-Nearest Neighbor Searching in Non-Ordered Discrete Data... |
PVLDB
2008
14 years 9 months ago
2008
The class of k Nearest Neighbor (kNN) queries is frequently used in geospatial applications. Many studies focus on processing kNN in Euclidean and road network spaces. Meanwhile, ...
EDBT
2008
ACM
15 years 9 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...
STOC
2006
ACM
15 years 9 months ago
2006
ACM
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...
127
click to vote
COMPGEOM
2010
ACM
15 years 2 months ago
2010
ACM
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
COMPGEOM
2010
ACM
15 years 2 months ago
2010
ACM
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...