382 search results - page 60 / 77 » Data Structures for Dynamic Queries: An Analytical and Exper... |
CPM
2006
Springer
13 years 11 months ago
2006
Springer
The Range-Minimum-Query-Problem is to preprocess an array such that the position of the minimum element between two specified indices can be obtained efficiently. We present a dire...
FGCS
2007
13 years 7 months ago
2007
Abstract. E-Science Semantic Grids can often be thought of as dynamic collection of semantic subgrids where each subgrid is a collection of modest number of services that assembled...
MM
2005
ACM
14 years 1 months ago
2005
ACM
The authors developed an extensible system for video exploitation that puts the user in control to better accommodate novel situations and source material. Visually dense displays...
ESA
2006
Springer
13 years 11 months ago
2006
Springer
A counting Bloom filter (CBF) generalizes a Bloom filter data structure so as to allow membership queries on a set that can be changing dynamically via insertions and deletions. As...
PODS
2008
ACM
14 years 7 months ago
2008
ACM
Processing large data streams is now a major topic in data management. The data involved can be truly massive, and the required analyses complex. In a stream of sequential events ...