806 search results - page 5 / 162 » An Optimal Dynamic Data Structure for Stabbing-Semigroup Que... |
JACM
2010
13 years 6 months ago
2010
We present a fully dynamic randomized data structure that can answer queries about the convex hull of a set of n points in three dimensions, where insertions take O(log3 n) expect...
ISAAC
2007
Springer
14 years 1 months ago
2007
Springer
In an uncertain data set S = (S, p, f) where S is the ground set consisting of n elements, p : S → [0, 1] a probability function, and f : S → R a score function, each element i...
COCOON
1998
Springer
13 years 11 months ago
1998
Springer
Abstract. In this paper we present the new data structure Colored Sector Search Tree (CSST ) for solving the Nearest-Foreign-Neighbor Query Problem (NFNQP ): Given a set S of n col...
AVI
1994
13 years 9 months ago
1994
SBBD
2004
13 years 9 months ago
2004
Metric Access Methods (MAM) are employed to accelerate the processing of similarity queries, such as the range and the k-nearest neighbor queries. Current methods improve the quer...