Sciweavers

452 search results - page 29 / 91
» A convex optimization approach to the mode acceleration prob...
Sort
View
ICCV
2003
IEEE
14 years 9 months ago
A Caratheodory-Fejer Approach to Robust Multiframe Tracking
A requirement common to most dynamic vision applications is the ability to track objects in a sequence of frames. This problem has been extensively studied in the past few years, ...
Octavia I. Camps, Hwasup Lim, Cecilia Mazzaro, Mar...
CVPR
2009
IEEE
15 years 2 months 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)
NIPS
2008
13 years 9 months ago
Clustered Multi-Task Learning: A Convex Formulation
In multi-task learning several related tasks are considered simultaneously, with the hope that by an appropriate sharing of information across tasks, each task may benefit from th...
Laurent Jacob, Francis Bach, Jean-Philippe Vert
ICML
2008
IEEE
14 years 8 months ago
Efficiently solving convex relaxations for MAP estimation
The problem of obtaining the maximum a posteriori (map) estimate of a discrete random field is of fundamental importance in many areas of Computer Science. In this work, we build ...
M. Pawan Kumar, Philip H. S. Torr
MP
2006
87views more  MP 2006»
13 years 7 months ago
Convexity and decomposition of mean-risk stochastic programs
Abstract. Traditional stochastic programming is risk neutral in the sense that it is concerned with the optimization of an expectation criterion. A common approach to addressing ri...
Shabbir Ahmed