3020 search results - page 293 / 604 » Similarity Queries on Structured Data in Structured Overlays |
163
click to vote
ESA
2000
Springer
15 years 10 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...
194
click to vote
NBIS
2007
Springer
16 years 28 days ago
2007
Springer
Range queries, retrieving all keys within a given range, is an important add-on for Distributed Hash Tables (DHTs), as they rely only on exact key matching lookup. In this paper we...
190
click to vote
SIAMCOMP
1998
15 years 6 months ago
1998
This paper describes new methods for maintaining a point-location data structure for a dynamically changing monotone subdivision S. The main approach is based on the maintenance of...
164
click to vote
SWAP
2007
15 years 8 months ago
2007
Abstract. Ontologies are pervading many areas of knowledge representation and management. To date, most research efforts have been spent on the development of sufficiently express...
174
click to vote
CSL
2010
Springer
15 years 6 months ago
2010
Springer
We study probabilistic complexity classes and questions of derandomisation from a logical point of view. For each logic L we introduce a new logic BPL, bounded error probabilistic ...