Sciweavers

1408 search results - page 103 / 282
» Dynamical Tensor Approximation
Sort
View
CCCG
2010
15 years 3 months ago
Connected dominating sets on dynamic geometric graphs
We propose algorithms for efficiently maintaining a constant-approximate minimum connected dominating set (MCDS) of a geometric graph under node insertions and deletions. Assuming...
Leonidas J. Guibas, Nikola Milosavljevic, Arik Mot...
SIAMMA
2010
122views more  SIAMMA 2010»
14 years 9 months ago
Asymptotic Flocking Dynamics for the Kinetic Cucker-Smale Model
In this paper, we analyse the asymptotic behavior of solutions of the continuous kinetic version of flocking by Cucker and Smale [16], which describes the collective behavior of an...
J. A. Carrillo, M. Fornasier, J. Rosado, G. Toscan...
ATAL
2010
Springer
15 years 3 months ago
Point-based backup for decentralized POMDPs: complexity and new algorithms
Decentralized POMDPs provide an expressive framework for sequential multi-agent decision making. Despite their high complexity, there has been significant progress in scaling up e...
Akshat Kumar, Shlomo Zilberstein
118
Voted
CGF
2008
109views more  CGF 2008»
15 years 2 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
115
Voted
ENTCS
2008
82views more  ENTCS 2008»
15 years 2 months ago
A Static Analysis for Beta-Binders
We introduce a Control Flow Analysis, that statically approximates the dynamic behaviour of processes, expressed in the Beta-Binders calculus. Our analysis of a system is able to ...
Chiara Bodei