1866 search results - page 234 / 374 » Robust Algorithms and Price of Robustness in Shunting Proble... |
354
click to vote
ECCV
2010
Springer
15 years 11 months ago
2010
Springer
Graph matching is an essential problem in computer vision and machine learning. In this paper, we introduce a random walk view on the problem and propose a robust graph matching al...
139
click to vote
COMGEO
2006
ACM
15 years 6 months ago
2006
ACM
Robustness problems due to the substitution of the exact computation on real numbers by the rounded floating point arithmetic are often an obstacle to obtain practical implementat...
145
click to vote
IJCV
2007
15 years 6 months ago
2007
Abstract. We address the problem of finding the correspondences of two point sets in 3D undergoing a rigid transformation. Using these correspondences the motion between the two s...
187
click to vote
IPPS
2010
IEEE
15 years 4 months ago
2010
IEEE
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
151
click to vote
GECCO
2005
Springer
15 years 12 months ago
2005
Springer
A commonly experienced problem with population based optimisation methods is the gradual decline in population diversity that tends to occur over time. This can slow a system’s ...