Sciweavers

38 search results - page 2 / 8
» Convex Quadratic Programming for Object Localization
Sort
View
ICPR
2008
IEEE
14 years 6 months ago
Solving quadratically constrained geometrical problems using lagrangian duality
In this paper we consider the problem of solving different pose and registration problems under rotational constraints. Traditionally, methods such as the iterative closest point ...
Carl Olsson, Anders Eriksson
CDC
2008
IEEE
172views Control Systems» more  CDC 2008»
13 years 7 months ago
Convex relaxation approach to the identification of the Wiener-Hammerstein model
In this paper, an input/output system identification technique for the Wiener-Hammerstein model and its feedback extension is proposed. In the proposed framework, the identificatio...
Kin Cheong Sou, Alexandre Megretski, Luca Daniel
CPAIOR
2007
Springer
13 years 11 months ago
Hybrid Local Search for Constrained Financial Portfolio Selection Problems
Portfolio selection is a relevant problem arising in finance and economics. While its basic formulations can be efficiently solved through linear or quadratic programming, its mor...
Luca Di Gaspero, Giacomo di Tollo, Andrea Roli, An...
CVPR
2009
IEEE
15 years 5 days ago
Convexity and Bayesian Constrained Local Models
The accurate localization of facial features plays a fundamental role in any face recognition pipeline. Constrained local models (CLM) provide an effective approach to localizati...
Ulrich Paquet (Imense Ltd)
ICCAD
1999
IEEE
86views Hardware» more  ICCAD 1999»
13 years 9 months ago
Clock skew scheduling for improved reliability via quadratic programming
This paper considers the problem of determining an optimal clock skew schedule for a synchronous VLSI circuit. A novel formulation of clock skew scheduling as a constrained quadrat...
Ivan S. Kourtev, Eby G. Friedman