577 search results - page 2 / 116 » New interval methods for constrained global optimization |
SARA
2009
Springer
15 years 4 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...
VMV
2001
14 years 11 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...
ICARCV
2006
IEEE
15 years 3 months ago
2006
IEEE
114
Voted
CVPR
2012
IEEE
12 years 12 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...
83
Voted
ICCV
2003
IEEE
15 years 11 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 ...