466 search results - page 60 / 94 » Preprocessing Search Spaces for Branch and Bound Search |
193
click to vote
ECCV
2008
Springer
16 years 8 months ago
2008
Springer
Efficient global optimization techniques such as graph cut exist for energies corresponding to binary image segmentation from lowlevel cues. However, introducing a high-level prior...
137
click to vote
AMC
2005
15 years 6 months ago
2005
We present an interval branch-and-prune algorithm for computing verified enclosures for the global minimum and all global minimizers of univariate functions subject to bound const...
208
click to vote
JMLR
2010
15 years 25 days ago
2010
We propose to solve the combinatorial problem of finding the highest scoring Bayesian network structure from data. This structure learning problem can be viewed as an inference pr...
166
click to vote
ATAL
2009
Springer
16 years 19 days ago
2009
Springer
Distributed Lagrangian Relaxation Protocol (DisLRP) has been proposed to solve a distributed combinatorial maximization problem called the Generalized Mutual Assignment Problem (G...
180
click to vote
CIKM
2009
Springer
15 years 10 months ago
2009
Springer
Traditional ranking mainly focuses on one type of data source, and effective modeling still relies on a sufficiently large number of labeled or supervised examples. However, in m...