Sciweavers

3049 search results - page 387 / 610
» On the Convergence of Bound Optimization Algorithms
Sort
View
128
Voted
ICRA
2002
IEEE
88views Robotics» more  ICRA 2002»
15 years 9 months ago
Curvature-Based Computation of Antipodal Grasps
It is well known that antipodal grasps can be achieved on curved objects in the presence of friction. This paper presents an efficient algorithm that finds, up to numerical reso...
Yan-Bin Jia
VMV
2007
122views Visualization» more  VMV 2007»
15 years 5 months ago
An iterative framework for registration with reconstruction
The core of most registration algorithms aligns scan data by pairs, minimizing their relative distance. This local optimization must generally pass through a validation procedure t...
Thales Vieira, Adelailson Peixoto, Luiz Velho, Tho...
CORR
2008
Springer
118views Education» more  CORR 2008»
15 years 4 months ago
Learning Low-Density Separators
Abstract. We define a novel, basic, unsupervised learning problem learning the the lowest density homogeneous hyperplane separator of an unknown probability distribution. This task...
Shai Ben-David, Tyler Lu, Dávid Pál,...
CSDA
2010
132views more  CSDA 2010»
15 years 4 months ago
Approximate low-rank factorization with structured factors
An approximate rank revealing factorization problem with structure constraints on the normalized factors is considered. Examples of structure, motivated by an application in micro...
Ivan Markovsky, Mahesan Niranjan
AROBOTS
2002
91views more  AROBOTS 2002»
15 years 4 months ago
Fast, On-Line Learning of Globally Consistent Maps
To navigate in unknown environments, mobile robots require the ability to build their own maps. A major problem for robot map building is that odometry-based dead reckoning cannot ...
Tom Duckett, Stephen Marsland, Jonathan Shapiro