1038 search results - page 76 / 208 » Space-Bounded Query Approximation |
123
Voted
FOCS
2008
IEEE
15 years 9 months ago
2008
IEEE
This work investigates a geometric approach to proving cell probe lower bounds for data structure problems. We consider the approximate nearest neighbor search problem on the Bool...
EDBT
2000
ACM
15 years 7 months ago
2000
ACM
The paper presents Spatial Distributions Server – an analytical tool aimed at efficient creation, storing and analyzing of spatial distributions. Methods of approximation of spat...
116
Voted
CIKM
2004
Springer
15 years 8 months ago
2004
Springer
We examine the problem of retrieving the top-m ranked items from a large collection, randomly distributed across an n-node system. In order to retrieve the top m overall, we must ...
121
click to vote
HOTOS
2007
IEEE
15 years 6 months ago
2007
IEEE
Existing distributed hash tables provide efficient mechanisms for storing and retrieving a data item based on an exact key, but are unsuitable when the search key is similar, but ...
103
Voted
DKE
2008
15 years 2 months ago
2008
Due to the heterogeneous nature of XML data for internet applications exact matching of queries is often inadequate. The need arises to quickly identify subtrees of XML documents ...