Motivated by potential efficiency and robustness gains, there is growing interest in the use of multiple robots for coverage. In coverage, robots visit every point in a target are...
We present an algorithm for fast posterior inference in penalized high-dimensional state-space models, suitable in the case where a few measurements are taken in each time step. W...
This paper introduces a new shape matching algorithm for computing correspondences between 3D surfaces that have undergone (approximately) isometric deformations. The new approach ...
Art Tevs (Max Planck Institute Informatik), Martin...
As compatible meshes play important roles in many computeraided design applications, we present a new approach for modelling compatible meshes. Our compatible mesh modelling metho...
Yu Wang, Charlie C. L. Wang, Matthew Ming-Fai Yuen
In the CLOSEST SUBSTRING problem k strings s1, ..., sk are given, and the task is to find a string s of length L such that each string si has a consecutive substring of length L ...