806 search results - page 65 / 162 » An Optimal Dynamic Data Structure for Stabbing-Semigroup Que... |
VLDB
1995
ACM
15 years 3 months ago
1995
ACM
Scientific data of importance to biologists in the Humitn Genome Project resides not only in conventional da.tabases, but in structured files maintained in a number of different f...
107
click to vote
SODA
2000
ACM
15 years 1 months ago
2000
ACM
Most research in algorithms for geometric query problems has focused on their worstcase performance. However, when information on the query distribution is available, the alternat...
106
click to vote
MASS
2010
14 years 9 months ago
2010
We present an integrated approach for supporting in-network sensor data processing in dynamic and heterogeneous sensor networks. The concept relies on data stream processing techni...
102
click to vote
ACMMSP
2005
ACM
15 years 5 months ago
2005
ACM
64-bit address spaces are increasingly important for modern applications, but they come at a price: pointers use twice as much memory, reducing the effective cache capacity and m...
205
click to vote
STOC
2012
ACM
13 years 2 months ago
2012
ACM
In this paper we develop a new technique for proving lower bounds on the update time and query time of dynamic data structures in the cell probe model. With this technique, we pro...