230 search results - page 8 / 46 » Data Structures for Restricted Triangular Range Searching |
ESA
2000
Springer
14 years 1 months 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 1 months 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...
ALGORITHMICA
2004
13 years 9 months ago
2004
Query answers from on-line databases can easily be corrupted by hackers or malicious database publishers. Thus it is important to provide mechanisms which allow clients to trust th...
MICAI
2004
Springer
14 years 3 months ago
2004
Springer
A number of problems in computer science can be solved efficiently with the so called memory based or kernel methods. Among this problems (relevant to the AI community) are multime...
VLDB
1998
ACM
14 years 2 months ago
1998
ACM
We propose and evaluate two indexing schemes for improving the efficiency of data retrieval in high-dimensional databases that are incomplete. These schemes are novel in that the ...