3533 search results - page 192 / 707 » Locally Optimized RANSAC |
145
click to vote
TCS
2008
15 years 6 months ago
2008
Distributed negotiation schemes offer one approach to agreeing an allocation of resources among a set of individual agents. Such schemes attempt to agree a distribution via a sequ...
171
click to vote
ICPR
2006
IEEE
16 years 7 months ago
2006
IEEE
K-Nearest Neighbors relies on the definition of a global metric. In contrast, Discriminant Adaptive Nearest Neighbor (DANN) computes a different metric at each query point based o...
148
click to vote
ICCV
2007
IEEE
16 years 8 months ago
2007
IEEE
We describe a new framework for globally solving the 3D-3D registration problem with unknown point correspondences. This problem is significant as it is frequently encountered in ...
159
click to vote
CP
2009
Springer
16 years 1 months ago
2009
Springer
We introduce Hegel and Fichte’s dialectic as a search meta-heuristic for constraint satisfaction and optimization. Dialectic is an appealing mental concept for local search as it...
200
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
In the independent component analysis, polynomial functions of higher order statistics are often used as cost functions. However, such cost functions usually have many local minim...