Sciweavers

447 search results - page 35 / 90
» Bounded Model Checking with Parametric Data Structures
Sort
View
B
2007
Springer
14 years 1 months ago
Symmetry Reduction for B by Permutation Flooding
Symmetry reduction is an established method for limiting the amount of states that have to be checked during exhaustive model checking. The idea is to only verify a single represen...
Michael Leuschel, Michael J. Butler, Corinna Sperm...
TSP
2010
13 years 2 months ago
Noisy data and impulse response estimation
Abstract--This paper investigates the impulse response estimation of linear time-invariant (LTI) systems when only noisy finitelength input-output data of the system is available. ...
Soosan Beheshti, Munther A. Dahleh
VRCAI
2006
ACM
14 years 1 months ago
Kinetic bounding volume hierarchies for deformable objects
We present novel algorithms for updating bounding volume hierarchies of objects undergoing arbitrary deformations. Therefore, we introduce two new data structures, the kinetic AAB...
Gabriel Zachmann, Rene Weller
ICALP
1992
Springer
13 years 11 months ago
Lower Bounds on the Complexity of Simplex Range Reporting on a Pointer Machine
Abstract Bernard Chazelle Department of Computer Science Princeton University Burton Rosenberg Department of Mathematics and Computer Science Dartmouth College We give a lower bou...
Bernard Chazelle, Burton Rosenberg
ICDE
2000
IEEE
158views Database» more  ICDE 2000»
14 years 9 months ago
The DC-Tree: A Fully Dynamic Index Structure for Data Warehouses
: Many companies have recognized the strategic importance of the knowledge hidden in their large databases and have built data warehouses. Typically, updates are collected and appl...
Hans-Peter Kriegel, Jörn Kohlhammer, Martin E...