Sciweavers

697 search results - page 34 / 140
» Convex Functions on Discrete Sets
Sort
View
ADAC
2008
193views more  ADAC 2008»
13 years 9 months ago
A constrained-optimization based half-quadratic algorithm for robustly fitting sets of linearly parametrized curves
We consider the problem of multiple fitting of linearly parametrized curves, that arises in many computer vision problems such as road scene analysis. Data extracted from images us...
Jean-Philippe Tarel, Sio-Song Ieng, Pierre Charbon...
ANOR
2010
107views more  ANOR 2010»
13 years 6 months ago
Kusuoka representation of higher order dual risk measures
We derive representations of higher order dual measures of risk in Lp spaces as suprema of integrals of Average Values at Risk with respect to probability measures on (0, 1] (Kusu...
Darinka Dentcheva, Spiridon Penev, Andrzej Ruszczy...
COLT
2006
Springer
14 years 19 days ago
Logarithmic Regret Algorithms for Online Convex Optimization
In an online convex optimization problem a decision-maker makes a sequence of decisions, i.e., chooses a sequence of points in Euclidean space, from a fixed feasible set. After ea...
Elad Hazan, Adam Kalai, Satyen Kale, Amit Agarwal
CRV
2011
IEEE
309views Robotics» more  CRV 2011»
12 years 8 months ago
Optimal Alignment of 3D Data for Spatial Discretization
—We present an algorithm that finds the rotation which best aligns a given configuration of directions on an unsorted set of directions. Using a cost function that we derive in...
Benjamin Huhle, Timo Schairer, Andreas Schilling, ...
CDC
2010
IEEE
112views Control Systems» more  CDC 2010»
13 years 3 months ago
Online Convex Programming and regularization in adaptive control
Online Convex Programming (OCP) is a recently developed model of sequential decision-making in the presence of time-varying uncertainty. In this framework, a decisionmaker selects ...
Maxim Raginsky, Alexander Rakhlin, Serdar Yük...