736 search results - page 19 / 148 » A dynamic data structure for approximate range searching |
ISAAC
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. We study the following one-dimensional range reporting problem: On an array A of n elements, support queries that given two indices i ≤ j and an integer k report the k ...
AINA
2009
IEEE
14 years 3 months ago
2009
IEEE
—This paper deals with the traditional IP address lookup problem with fast updates. We propose a B-tree data structure, called MMSPT (Multiway Most Specific Prefix Tree), which i...
WWW
2009
ACM
14 years 9 months ago
2009
ACM
Web search engines often federate many user queries to relevant structured databases. For example, a product related query might be federated to a product database containing thei...
ESA
2000
Springer
14 years 15 days ago
2000
Springer
We show that a popular variant of the well known k-d tree data structure satisfies an important packing lemma. This variant is a binary spatial partitioning tree T defined on a set...
SPAA
1990
ACM
14 years 28 days ago
1990
ACM
Fractional cascading is a technique designed to allow e cient sequential search in a graph with catalogs of total size n. The search consists of locating a key in the catalogs alo...