402 search results - page 81 / 81 » A branch and cut algorithm for the Steiner problem in graphs |
SIAMIS
2010
13 years 1 months ago
2010
Simulated annealing (SA) and deterministic continuation are well-known generic approaches to global optimization. Deterministic continuation is computationally attractive but produ...
ECCV
2008
Springer
14 years 8 months ago
2008
Springer
As richer models for stereo vision are constructed, there is a growing interest in learning model parameters. To estimate parameters in Markov Random Field (MRF) based stereo formu...