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...
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...
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...
—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, ...
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 ...