A wide variety of stability and performance questions about linear dynamical systems can be reformulated as convex optimization problems involving linear matrix inequalities (LMIs...
Erin M. Aylward, Pablo A. Parrilo, Jean-Jacques E....
Several approximation algorithms with proven performance guarantees have been proposed to find approximate solutions to classical combinatorial optimization problems. However, the...
We address the problem of autonomously learning controllers for visioncapable mobile robots. We extend McCallum's (1995) Nearest-Sequence Memory algorithm to allow for genera...
Viktor Zhumatiy, Faustino J. Gomez, Marcus Hutter,...
In this paper a new method for the combination of 2D GIS vector data and 2.5D DTM represented by triangulated irregular networks (TIN) to derive integrated triangular 2.5D object-b...
We develop a new algorithm for clustering search results. Differently from many other clustering systems that have been recently proposed as a post-processing step for Web search ...