921 search results - page 21 / 185 » New Data Structures for Orthogonal Range Searching |
153
Voted
JAIR
2006
15 years 3 months ago
2006
Fast Downward is a classical planning system based on heuristic search. It can deal with general deterministic planning problems encoded in the propositional fragment of PDDL2.2, ...
163
Voted
COCOON
1998
Springer
15 years 8 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...
117
click to vote
ADBIS
2010
Springer
15 years 5 months ago
2010
Springer
Multidimensional data structures are applied in many areas, e.g. in data mining, indexing multimedia data and text documents, and so on. There are some applications where the range...
133
click to vote
COMPGEOM
2009
ACM
15 years 10 months ago
2009
ACM
We consider a number of range reporting problems in two and three dimensions and prove lower bounds on the amount of space used by any cache-oblivious data structure for these pro...
112
click to vote
SODA
2004
ACM
15 years 5 months ago
2004
ACM
d Abstract] Robert Krauthgamer James R. Lee We present a simple deterministic data structure for maintaining a set S of points in a general metric space, while supporting proximit...