Sciweavers

269 search results - page 5 / 54
» A branch and bound method for stochastic global optimization
Sort
View
CVPR
2008
IEEE
15 years 27 days ago
Globally optimal bilinear programming for computer vision applications
We present a practical algorithm that provably achieves the global optimum for a class of bilinear programs commonly arising in computer vision applications. Our approach relies o...
Manmohan Krishna Chandraker, David J. Kriegman
IWANN
2007
Springer
14 years 5 months ago
Speeding Up the Dissimilarity Self-Organizing Maps by Branch and Bound
Abstract. This paper proposes to apply the branch and bound principle from combinatorial optimization to the Dissimilarity Self-Organizing Map (DSOM), a variant of the SOM that can...
Brieuc Conan-Guez, Fabrice Rossi
ICPR
2006
IEEE
14 years 12 months ago
Fast Dichotomic Multiple Search Algorithm for Shortest Cirular Path
Circular shortest path algorithms for polar objects segmentation have been proposed in [1, 11, 10] to address discrete case and extended in [2] to the continuous domain for closed...
Martin de La Gorce, Nikos Paragios
CP
2008
Springer
14 years 20 days ago
Revisiting the Upper Bounding Process in a Safe Branch and Bound Algorithm
Abstract. Finding feasible points for which the proof succeeds is a critical issue in safe Branch and Bound algorithms which handle continuous problems. In this paper, we introduce...
Alexandre Goldsztejn, Yahia Lebbah, Claude Michel,...