Sciweavers

82 search results - page 1 / 17
» A New Multisection Technique in Interval Methods for Global ...
Sort
View
79
Voted
MP
2006
123views more  MP 2006»
14 years 10 months ago
New interval methods for constrained global optimization
Abstract. Interval analysis is a powerful tool which allows to design branch-and-bound algorithms able to solve many global optimization problems. In this paper we present new adap...
Mihály Csaba Markót, J. Ferná...
COMPUTING
2000
61views more  COMPUTING 2000»
14 years 10 months ago
A New Multisection Technique in Interval Methods for Global Optimization
Leocadio G. Casado, Inmaculada García, Tibo...
86
Voted
ICCV
2003
IEEE
16 years 5 days ago
Globally Convergent Autocalibration
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 ...
Arrigo Benedetti, Alessandro Busti, Michela Farenz...
71
Voted
JSCIC
2010
101views more  JSCIC 2010»
14 years 5 months ago
Boundary-Conforming Discontinuous Galerkin Methods via Extensions from Subdomains
A new way of devising numerical methods is introduced whose distinctive feature is the computation of a finite element approximation only in a polyhedral subdomain D of the origina...
Bernardo Cockburn, Deepa Gupta, Fernando Reitich
118
Voted
CVPR
2012
IEEE
13 years 20 days ago
Globally optimal line clustering and vanishing point estimation in Manhattan world
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...
Jean Charles Bazin, Yongduek Seo, Cédric De...