921 search results - page 30 / 185 » New Data Structures for Orthogonal Range Searching |
128
Voted
CORR
2008
Springer
15 years 3 months ago
2008
Springer
We consider the problem of self-healing in peer-to-peer networks that are under repeated attack by an omniscient adversary. We assume that the following process continues for up t...
134
Voted
COMPGEOM
2007
ACM
15 years 7 months ago
2007
ACM
The paper consists of two major parts. In the first part, we re-examine relative -approximations, previously studied in [12, 13, 18, 25], and their relation to certain geometric p...
126
click to vote
GCB
2004
Springer
15 years 9 months ago
2004
Springer
: The main contribution of this paper is a novel approach for fast searching in huge structural databases like the PDB. The data structure is based on an adaption of the generalize...
171
Voted
SDM
2012
SIAM
13 years 6 months ago
2012
SIAM
Many high-profile applications pose high-dimensional nearest-neighbor search problems. Yet, it still remains difficult to achieve fast query times for state-of-the-art approache...
148
Voted
CIKM
2008
Springer
15 years 5 months ago
2008
Springer
This paper presents a unified framework for the evaluation of a range of structured document retrieval (SDR) approaches and tasks. The framework is based on a model of tree retrie...