269 search results - page 3 / 54 » A branch and bound method for stochastic global optimization |
OL
2011
13 years 1 months ago
2011
In this paper we present a methodology for finding tight convex relaxations for a special set of quadratic constraints given by bilinear and linear terms that frequently arise in ...
CVPR
2008
IEEE
15 years 27 days ago
2008
IEEE
We present a motion estimation algorithm for multicamera systems consisting of more than one calibrated camera securely attached on a moving object. So, they move all together, bu...
ICPR
2006
IEEE
14 years 12 months ago
2006
IEEE
In this paper we propose a practical and efficient method for finding the globally optimal solution to the problem of camera pose estimation for calibrated cameras. While traditio...
DMIN
2007
14 years 10 days ago
2007
— The application of feature selection techniques greatly reduces the computational cost of classifying highdimensional data. Feature selection algorithms of varying performance ...
IPPS
2007
IEEE
14 years 5 months ago
2007
IEEE
Solving optimally large instances of combinatorial optimization problems requires a huge amount of computational resources. In this paper, we propose an adaptation of the parallel...