Sciweavers

1082 search results - page 167 / 217
» Approximation Algorithms for Spreading Points
Sort
View
RAS
2008
124views more  RAS 2008»
13 years 9 months ago
On redundancy, efficiency, and robustness in coverage for multiple robots
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...
Noam Hazon, Gal A. Kaminka
JMLR
2012
12 years 11 days ago
Fast interior-point inference in high-dimensional sparse, penalized state-space models
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...
Eftychios A. Pnevmatikakis, Liam Paninski
CVPR
2009
IEEE
15 years 5 months ago
Isometric Registration of Ambiguous and Partial Data
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...
SMA
2006
ACM
121views Solid Modeling» more  SMA 2006»
14 years 3 months ago
Duplicate-skins for compatible mesh modelling
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
FOCS
2005
IEEE
14 years 3 months ago
The Closest Substring problem with small distances
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 ...
Dániel Marx