56 search results - page 2 / 12 » The Solution Space of Sorting by Reversals |
CIKM
2006
Springer
13 years 9 months ago
2006
Springer
In this paper, we propose an approach for efficient approximative RkNN search in arbitrary metric spaces where the value of k is specified at query time. Our method uses an approx...
SIGMOD
2006
ACM
14 years 5 months ago
2006
ACM
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, is a generalization of the...
CORR
2010
Springer
13 years 8 days ago
2010
Springer
In this paper we describe a new efficient (in fact optimal) data structure for the top-K color problem. Each element of an array A is assigned a color c with priority p(c). For a ...
SSDBM
2009
IEEE
14 years 1 days ago
2009
IEEE
Abstract. We propose an original solution for the general reverse k-nearest neighbor (RkNN) search problem in Euclidean spaces. Compared to the limitations of existing methods for ...
MCSS
2008
Springer
13 years 4 months ago
2008
Springer
In this paper we deal with a perturbed algebraic Riccati equation in an infinite dimensional Banach space. Besides the interest in its own right, this class of equations appears, ...