1082 search results - page 41 / 217 » Approximation Algorithms for Spreading Points |
APPROX
2008
Springer
13 years 9 months ago
2008
Springer
Clustering is a common problem in the analysis of large data sets. Streaming algorithms, which make a single pass over the data set using small working memory and produce a cluster...
CGF
2010
13 years 7 months ago
2010
A common operation in many geometry processing algorithms consists of finding correspondences between pairs of shapes by finding structure-preserving maps between them. A particul...
MP
2002
13 years 7 months ago
2002
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 ...
ICMCS
2006
IEEE
14 years 1 months ago
2006
IEEE
An algorithm for finding coupling points plays an important role in the Iterative Closest Point algorithm (ICP) which is widely used in registration applications in medical and 3-...
CEC
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract— Designing efficient algorithms for difficult multiobjective optimization problems is a very challenging problem. In this paper a new clustering multi-objective evolut...