128
Voted
JGO
2010
14 years 10 months ago
2010
The best known method to find exact or at least -approximate solutions to polynomial programming problems is the spatial Branch-and-Bound algorithm, which rests on computing lower...
129
Voted
NIPS
2007
15 years 5 months ago
2007
The problem of obtaining the maximum a posteriori estimate of a general discrete random field (i.e. a random field defined using a finite and discrete set of labels) is known ...
104
Voted
CDC
2008
IEEE
15 years 10 months ago
2008
IEEE
This paper deals with convex relaxations for quadratic distance problems, a class of optimization problems relevant to several important topics in the analysis and synthesis of ro...
146
click to vote
ICCV
2005
IEEE
16 years 5 months ago
2005
IEEE
We introduce a framework for computing statistically optimal estimates of geometric reconstruction problems. While traditional algorithms often suffer from either local minima or ...