263 search results - page 17 / 53 » Efficient Variants of the ICP Algorithm |
144
click to vote
TAINN
2005
Springer
15 years 5 months ago
2005
Springer
Satisfiability problem is an NP-complete problem that finds itself or its variants in many combinatorial problems. There exist many complete algorithms that give successful results...
AAAI
1998
15 years 1 months ago
1998
A Messy Genetic Algorithm is customized toflnd'optimal many-to-many matches for 2D line segment models. The Messy GA is a variant upon the Standard Genetic Algorithm in which...
65
Voted
ICML
2010
IEEE
15 years 25 days ago
2010
IEEE
Optimization problems with a nuclear norm regularization, such as e.g. low norm matrix factorizations, have seen many applications recently. We propose a new approximation algorit...
76
Voted
ICFP
2008
ACM
15 years 11 months ago
2008
ACM
The Revised6 Report on Scheme requires its generic equivalence predicate, equal?, to terminate even on cyclic inputs. While the terminating equal? can be implemented via a DFA-equ...
178
click to vote
ICDE
2006
IEEE
16 years 1 months ago
2006
IEEE
A top-k query combines different rankings of the same set of objects and returns the k objects with the highest combined score according to an aggregate function. We bring to ligh...