Sciweavers

3360 search results - page 293 / 672
» Opportunistic Data Structures with Applications
Sort
View
ISAAC
2009
Springer
132views Algorithms» more  ISAAC 2009»
15 years 11 months ago
Online Sorted Range Reporting
Abstract. We study the following one-dimensional range reporting problem: On an array A of n elements, support queries that given two indices i ≤ j and an integer k report the k ...
Gerth Stølting Brodal, Rolf Fagerberg, Mark...
130
Voted
SIGMOD
1997
ACM
146views Database» more  SIGMOD 1997»
15 years 9 months ago
Concurrency and Recovery in Generalized Search Trees
This paper presents general algorithms for concurrency control in tree-based access methods as well as a recovery protocol and a mechanism for ensuring repeatable read. The algori...
Marcel Kornacker, C. Mohan, Joseph M. Hellerstein
EWC
2002
90views more  EWC 2002»
15 years 4 months ago
An Efficient Adaptive Procedure for Three-Dimensional Fragmentation Simulations
We present a simple set of data structures, and a collection of methods for constructing and updating the structures, designed to support the use of cohesive elements in simulation...
Anna Pandolfi, Michael Ortiz
DEBU
2002
161views more  DEBU 2002»
15 years 4 months ago
Indexing and Retrieval of Historical Aggregate Information about Moving Objects
Spatio-temporal databases store information about the positions of individual objects over time. In many applications however, such as traffic supervision or mobile communication ...
Dimitris Papadias, Yufei Tao, Jun Zhang, Nikos Mam...
CGF
2008
157views more  CGF 2008»
15 years 5 months ago
Interactive Volume Rendering with Dynamic Ambient Occlusion and Color Bleeding
We propose a method for rendering volumetric data sets at interactive frame rates while supporting dynamic ambient occlusion as well as an approximation to color bleeding. In cont...
Timo Ropinski, Jennis Meyer-Spradow, Stefan Diepen...