806 search results - page 26 / 162 » An Optimal Dynamic Data Structure for Stabbing-Semigroup Que... |
STACS
1997
Springer
13 years 11 months ago
1997
Springer
We consider the problem of maintaining a set of n integers in the range 0::2w ? 1 under the operations of insertion, deletion, predecessor queries, minimum queries and maximum quer...
COMPGEOM
2009
ACM
14 years 2 months ago
2009
ACM
We consider a number of range reporting problems in two and three dimensions and prove lower bounds on the amount of space used by any cache-oblivious data structure for these pro...
RTDB
1996
13 years 9 months ago
1996
We are developing an object-oriented real-time database system that includes a relationally complete query language. Unlike conventional query optimizers, our optimizer estimates ...
PVLDB
2010
13 years 6 months ago
2010
To enable smart environments and self-tuning data centers, we are developing the Aspen system for integrating physical sensor data, as well as stream data coming from machine logi...
JEA
2008
13 years 7 months ago
2008
The Spatial Approximation Tree (sa-tree) is a recently proposed data structure for searching in metric spaces. It has been shown that it compares favorably against alternative data...