49 search results - page 10 / 10 » Efficient Algorithms to Monitor Continuous Constrained k Nea... |
DKE
2006
13 years 9 months ago
2006
The K-Closest-Pairs Query (K-CPQ), a type of distance join in spatial databases, discovers the K pairs of objects formed from two different datasets with the K smallest distances....
JGTOOLS
2006
13 years 9 months ago
2006
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...
ALGOSENSORS
2009
Springer
14 years 3 months ago
2009
Springer
We introduce a framework for storing and processing kinetic data observed by sensor networks. These sensor networks generate vast quantities of data, which motivates a significant...
EDBT
2008
ACM
14 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...