Sciweavers

2333 search results - page 143 / 467
» Recursive Computational Depth
Sort
View
IWUC
2004
13 years 11 months ago
On Uncertainty in Context-Aware Computing: Appealing to High-Level and Same-Level Context for Low-Level Context Verification
There is an inherent chasm between the real-world and the world that can be perceived by computer systems, yielding uncertainty and ambiguity in system perceived context, with cons...
Amir Padovitz, Seng Wai Loke, Arkady B. Zaslavsky
VMV
2004
103views Visualization» more  VMV 2004»
13 years 11 months ago
Hardware-accelerated ambient occlusion computation
In this paper, we present a novel, hardwareaccelerated approach to compute the visibility between surface points and directional light sources. Thus, our method provides a first-o...
Mirko Sattler, Ralf Sarlette, Gabriel Zachmann, Re...
CADE
2005
Springer
14 years 10 months ago
Temporal Logics over Transitive States
Abstract. We investigate the computational behaviour of `two-dimensional' propositional temporal logics over (N, <) (with and without the next-time operator ?) that are cap...
Boris Konev, Frank Wolter, Michael Zakharyaschev
ESOP
1999
Springer
14 years 1 months ago
Dynamic Programming via Static Incrementalization
Abstract. Dynamicprogramming is an importantalgorithm design technique. It is used for solving problems whose solutions involve recursively solving subproblems that share subsubpro...
Yanhong A. Liu, Scott D. Stoller
SPAA
2009
ACM
14 years 2 months ago
Brief announcement: a lower bound for depth-restricted work stealing
Work stealing is a common technique used in the runtime schedulers of parallel languages such as Cilk and parallel libraries such as Intel Threading Building Blocks (TBB). Depth-r...
Jim Sukha