In distributed combinatorial optimization problems, dynamic programming algorithms like DPOP ([Petcu and Faltings, 2005]) require only a linear number of messages, thus generating...
While spectral clustering has been applied successfully to problems in computer vision, their applicability is limited to pairwise similarity measures that form a probability matr...
Abstract. Background updating is an important aspect of dynamic scene analysis. Two critical problems: sudden camera perturbation and the sleeping person problem, which arise frequ...
The paper provides a unifying perspective of tree-decomposition algorithms appearing in various automated reasoning areas such as join-tree clustering for constraint-satisfaction ...
Kalev Kask, Rina Dechter, Javier Larrosa, Avi Dech...
This paper describes SymbioticSphere, a novel biologically-inspired architecture that allows grid systems (application services and middleware platforms) to be scalable and adapti...