Sciweavers

3637 search results - page 107 / 728
» On Dynamic Bit-Probe Complexity
Sort
View
CGF
2008
109views more  CGF 2008»
13 years 9 months ago
Occlusion Textures for Plausible Soft Shadows*
Authors' version: This paper presents a novel approach to obtain plausible soft shadows for complex dynamic scenes and a rectangular light source. We estimate the lights occl...
Elmar Eisemann, Xavier Décoret
MDM
2010
Springer
213views Communications» more  MDM 2010»
13 years 7 months ago
Towards Adaptive Sensor Data Management for Distributed Fire Evacuation Infrastructure
— We introduce a novel strategy for data processing in Wireless Sensor Networks (WSNs) in the case of emergency fire evacuation with stringent delay constraints. Such networks sh...
Andrii Cherniak, Vladimir Zadorozhny
SASO
2010
IEEE
13 years 7 months ago
Extracting Overlay Invariants of Distributed Systems for Autonomic System Management
Many large-scale distributed systems have been built with great complexity to run Internet services. Due to the heterogeneity and dynamics of complex systems, it is very difficult ...
Hanhuai Shan, Guofei Jiang, Kenji Yoshihira
SIGSOFT
2011
ACM
13 years 4 months ago
Modeling a distributed intrusion detection system using collaborative building blocks
Developing complex distributed systems is a non-trivial task. It is even more difficult when the systems need to dynamically reconfigure the distributed functionalities or tasks...
Linda Ariani Gunawan, Michael Vogel, Frank Alexand...
WG
2009
Springer
14 years 3 months ago
Fully Dynamic Representations of Interval Graphs
We present a fully dynamic algorithm that maintains three different representations of an interval graph: a minimal interval model of the graph, the PQ-tree of its maximal cliques...
Christophe Crespelle