269 search results - page 5 / 54 » A branch and bound method for stochastic global optimization |
CVPR
2008
IEEE
16 years 2 months ago
2008
IEEE
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...
74
Voted
INFORMS
2007
15 years 8 days ago
2007
104
click to vote
IWANN
2007
Springer
15 years 6 months ago
2007
Springer
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...
ICPR
2006
IEEE
16 years 1 months ago
2006
IEEE
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...
77
Voted
CP
2008
Springer
15 years 2 months ago
2008
Springer
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...