697 search results - page 70 / 140 » Convex Functions on Discrete Sets |
COMPGEOM
2010
ACM
14 years 1 months ago
2010
ACM
The Reeb graph of a scalar function represents the evolution of the topology of its level sets. In this video, we describe a near-optimal output-sensitive algorithm for computing ...
EJC
2008
13 years 8 months ago
2008
Let X be a set of points in general position in the plane. General position means that no three points lie on a line and no two points have the same x-coordinate. Y X is a cup, r...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
Iterative algorithms aimed at solving some problems are discussed. For certain problems, such as finding a common point in the intersection of a finite number of convex sets, there...
EOR
2008
13 years 8 months ago
2008
The aim of this paper is to apply the concept of robust optimization introduced by Bel-Tal and Nemirovski to the portfolio selection problems based on multi-stage scenario trees. ...
FOCM
2010
13 years 7 months ago
2010
Free-discontinuity problems describe situations where the solution of interest is defined by a function and a lower dimensional set consisting of the discontinuities of the funct...