806 search results - page 88 / 162 » An Optimal Dynamic Data Structure for Stabbing-Semigroup Que... |
108
click to vote
COMPGEOM
2006
ACM
15 years 7 months ago
2006
ACM
This paper addresses the problem of representing the connectivity information of geometric objects using as little memory as possible. As opposed to raw compression issues, the fo...
106
click to vote
VLDB
2001
ACM
15 years 5 months ago
2001
ACM
In recent years, several methods have been proposed for implementing interactive similarity queries on multimedia databases. Common to all these methods is the idea to exploit use...
109
click to vote
MOBIHOC
2006
ACM
16 years 1 months ago
2006
ACM
Data storage has become an important issue in sensor networks as a large amount of collected data need to be archived for future information retrieval. This paper introduces stora...
FOCS
2006
IEEE
15 years 7 months ago
2006
IEEE
We investigate the optimality of (1+ )-approximation algorithms obtained via the dimensionality reduction method. We show that: • Any data structure for the (1 + )-approximate n...
107
click to vote
SPAA
2009
ACM
16 years 1 months ago
2009
ACM
Hash tables are one of the most fundamental data structures in computer science, in both theory and practice. They are especially useful in external memory, where their query perf...