We introduce the Concave-Convex procedure (CCCP) which constructs discrete time iterative dynamical systems which are guaranteed to monotonically decrease global optimization/ener...
Abstract One of the goals envisioned by Grid computing is to make the execution of both computational and data-intensive problems possible. A key problem is finding the optimal set...
Marc De Leenheer, Pieter Thysebaert, Bruno Volckae...
We present a novel POMDP planning algorithm called heuristic search value iteration (HSVI). HSVI is an anytime algorithm that returns a policy and a provable bound on its regret w...
We present two extensions of the algorithm by Broomhead et al [2] which is based on the idea that singular values that scale linearly with the radius of the data ball can be explo...
We present a probabilistic method for fusion of images produced by multiple sensors. The approach is based on an image formation model in which the sensor images are noisy, locall...