Sciweavers

573 search results - page 18 / 115
» Lighting Networks - A New Approach for Designing Lighting Al...
Sort
View
FLAIRS
2001
13 years 9 months ago
Maximal Prime Subgraph Decomposition of Bayesian Networks
A maximal prime subgraph decomposition junction tree (MPD-JT) is a useful computational structure that facilitates lazy propagation in Bayesian networks (BNs). A graphical method ...
Kristian G. Olesen, Anders L. Madsen
CP
2006
Springer
13 years 11 months ago
A Structural Characterization of Temporal Dynamic Controllability
An important issue for temporal planners is the ability to handle temporal uncertainty. Recent papers have addressed the question of how to tell whether a temporal network is Dynam...
Paul Morris
IMC
2003
ACM
14 years 1 months ago
Network performance monitoring at small time scales
SNMP statistics are usually collected over intervals of 5 minutes and correspond to average activity of IP links and network elements for the duration of the interval. Nevertheles...
Konstantina Papagiannaki, Rene L. Cruz, Christophe...
CVPR
2009
IEEE
14 years 1 months ago
Catadioptric Projectors
We present a catadioptric projector analogous to a catadioptric camera by combining a commodity digital projector with additional optical units. We show that, by using specially sh...
Yuanyuan Ding, Jing Xiao, Kar-Han Tan, Jingyi Yu
CGF
2008
122views more  CGF 2008»
13 years 7 months ago
Accurate Shadows by Depth Complexity Sampling
The accurate generation of soft shadows is a particularly computationally intensive task. In order to reduce rendering time, most real-time and offline applications decorrelate th...
Vincent Forest, Loïc Barthe, Mathias Paulin