340 search results - page 1 / 68 » Efficient algorithms for bichromatic separability |
SODA
2004
ACM
14 years 6 days ago
2004
ACM
Publication
This paper presents a novel algorithm for Incremental and General Evaluation of continuous Reverse Nearest neighbor queries (IGERN, for short). The IGERN algorithm is general as it...
PVLDB
2008
13 years 9 months ago
2008
A Reverse k-Nearest-Neighbor (RkNN) query finds the objects that take the query object as one of their k nearest neighbors. In this paper we propose new solutions for evaluating R...
SIGMOD
2008
ACM
14 years 11 months ago
2008
ACM
Reverse skyline queries over uncertain databases have many important applications such as sensor data monitoring and business planning. Due to the existence of uncertainty in many...
JPDC
2010
13 years 5 months ago
2010
We present an efficient parallel algorithm for building the separating tree for a separable permutation. Our algorithm runs in O(log2 n) time using O(n log n) operations on the CR...