139 search results - page 9 / 28 » A Grid-enabled Branch and Bound Algorithm for Solving Challe... |
119
click to vote
CP
2006
Springer
15 years 7 months ago
2006
Springer
We consider probabilistic constrained linear programs with general distributions for the uncertain parameters. These problems generally involve non-convex feasible sets. We develo...
178
click to vote
CVPR
2012
IEEE
13 years 9 months ago
2012
IEEE
We present a new algorithm to jointly track multiple objects in multi-view images. While this has been typically addressed separately in the past, we tackle the problem as a single...
114
click to vote
CORR
2006
Springer
15 years 3 months ago
2006
Springer
The decision tree is one of the most fundamental ing abstractions. A commonly used type of decision tree is the alphabetic binary tree, which uses (without loss of generality) &quo...
128
Voted
CP
2001
Springer
15 years 7 months ago
2001
Springer
The Constraint Problems usually addressed fall into one of two models: the Constraint Satisfaction Problem (CSP) and the Constraint Optimization Problem (COP). However, in many rea...
126
click to vote
CVPR
2008
IEEE
16 years 5 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...