Sciweavers

14386 search results - page 104 / 2878
» The Chinese Generals Problem
Sort
View
MOR
2008
73views more  MOR 2008»
15 years 3 months ago
Separation of Nonconvex Sets with General Augmenting Functions
In this paper, we consider two geometric optimization problems that are dual to each other and characterize conditions under which the optimal values of the two problems are equal...
Angelia Nedic, Asuman E. Ozdaglar
162
Voted
ICRA
2010
IEEE
265views Robotics» more  ICRA 2010»
15 years 1 months ago
A generalization of the metric-based Iterative Closest Point technique for 3D scan matching
— Scan matching techniques have been widely used to compute the displacement of robots. This estimate is part of many algorithms addressing navigation and mapping. This paper add...
Leopoldo Armesto, Javier Minguez, Luis Montesano
146
Voted
3DPVT
2006
IEEE
240views Visualization» more  3DPVT 2006»
15 years 9 months ago
Global Depth from Epipolar Volumes--A General Framework for Reconstructing Non-Lambertian Surfaces
Using Epipolar Image Analysis in the context of the correspondence finding problem in depth reconstruction has several advantages. One is the elegant incorporation of prior knowl...
Timo Stich, Art Tevs, Marcus A. Magnor
COMPGEOM
2007
ACM
15 years 7 months ago
Bi-criteria linear-time approximations for generalized k-mean/median/center
We consider the problem of approximating a set P of n points in Rd by a collection of j-dimensional flats, and extensions thereof, under the standard median / mean / center measur...
Dan Feldman, Amos Fiat, Micha Sharir, Danny Segev
119
Voted
ATAL
2010
Springer
15 years 4 months ago
A general, fully distributed multi-agent planning algorithm
We present a fully distributed multi-agent planning algorithm. Our methodology uses distributed constraint satisfaction to coordinate between agents, and local planning to ensure ...
Raz Nissim, Ronen I. Brafman, Carmel Domshlak