Sciweavers

1466 search results - page 225 / 294
» Complexity of Reasoning over Temporal Data Models
Sort
View
DAGSTUHL
2010
14 years 11 months ago
Generalized Hyper-cylinders: a Mechanism for Modeling and Visualizing N-D Objects
The display of surfaces and solids has usually been restricted to the domain of scientific visualization; however, little work has been done on the visualization of surfaces and s...
Matthew O. Ward, Zhenyu Guo
COCO
2003
Springer
118views Algorithms» more  COCO 2003»
15 years 3 months ago
Lower bounds for predecessor searching in the cell probe model
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
Pranab Sen
ADBIS
1997
Springer
109views Database» more  ADBIS 1997»
15 years 1 months ago
A Graphical Yet Formalized Framework for Specifying View Systems
A graphical formalized language is proposed for specifying systems of views over database schemas. The language is based on the notion of arrow (mapping) between data schemas and ...
Zinovy Diskin, Boris Cadish
POPL
2005
ACM
15 years 10 months ago
Transition predicate abstraction and fair termination
on Predicate Abstraction and Fair Termination Andreas Podelski Andrey Rybalchenko Max-Planck-Institut f?ur Informatik Saarbr?ucken, Germany Predicate abstraction is the basis of m...
Andreas Podelski, Andrey Rybalchenko
RT
2004
Springer
15 years 3 months ago
All-Frequency Precomputed Radiance Transfer for Glossy Objects
We introduce a method based on precomputed radiance transfer (PRT) that allows interactive rendering of glossy surfaces and includes shadowing effects from dynamic, “all-frequen...
Xinguo Liu, Peter-Pike J. Sloan, Heung-Yeung Shum,...