577 search results - page 2 / 116 » New interval methods for constrained global optimization |
104
Voted
SARA
2009
Springer
15 years 6 months ago
2009
Springer
MINLP problems are hard constrained optimization problems, with nonlinear constraints and mixed discrete continuous variables. They can be solved using a Branch-and-Bound scheme c...
111
click to vote
VMV
2001
15 years 1 months ago
2001
Efficient isosurface extraction from large volume data sets requires special algorithms and data structures. Such algorithms typically either use a hierarchical spatial subdivisio...
60
Voted
ICARCV
2006
IEEE
15 years 5 months ago
2006
IEEE
129
click to vote
CVPR
2012
IEEE
13 years 2 months ago
2012
IEEE
The projections of world parallel lines in an image intersect at a single point called the vanishing point (VP). VPs are a key ingredient for various vision tasks including rotati...
95
Voted
ICCV
2003
IEEE
16 years 1 months ago
2003
IEEE
Existing autocalibration techniques use numerical optimization algorithms that are prone to the problem of local minima. To address this problem, we have developed a method where ...