Sciweavers

199 search results - page 12 / 40
» Approximating Center Points with Iterated Radon Points
Sort
View
IJCV
2006
142views more  IJCV 2006»
13 years 7 months ago
Geometry and Convergence Analysis of Algorithms for Registration of 3D Shapes
The computation of a rigid body transformation which optimally aligns a set of measurement points with a surface and related registration problems are studied from the viewpoint o...
Helmut Pottmann, Qi-Xing Huang, Yong-Liang Yang, S...
FSTTCS
2009
Springer
14 years 2 months ago
Iterative Methods in Combinatorial Optimization
We describe a simple iterative method for proving a variety of results in combinatorial optimization. It is inspired by Jain’s iterative rounding method (FOCS 1998) for designing...
R. Ravi
MP
2002
176views more  MP 2002»
13 years 7 months ago
UOBYQA: unconstrained optimization by quadratic approximation
UOBYQA is a new algorithm for general unconstrained optimization calculations, that takes account of the curvature of the objective function, F say, by forming quadratic models by ...
M. J. D. Powell
COMGEO
2004
ACM
13 years 7 months ago
A local search approximation algorithm for k-means clustering
In k-means clustering we are given a set of n data points in d-dimensional space d and an integer k, and the problem is to determine a set of k points in d , called centers, to mi...
Tapas Kanungo, David M. Mount, Nathan S. Netanyahu...
IOR
2008
119views more  IOR 2008»
13 years 7 months ago
Integrating Approximation and Interactive Decision Making in Multicriteria Optimization
We present a new interactive hybrid approach for solving multicriteria optimization problems where features of approximation methods and interactive approaches are incorporated. W...
Kathrin Klamroth, Kaisa Miettinen