92 search results - page 3 / 19 » On Maximal S-Free Convex Sets |
FOCS
1992
IEEE
13 years 10 months ago
1992
IEEE
Consider a convex set P in IRd and a piecewise polynomial concave function F: P IR. Let A be an algorithm that given a point x IRd computes F(x) if x P, or returns a concave po...
NIPS
2007
13 years 7 months ago
2007
We present a novel boosting algorithm, called SoftBoost, designed for sets of binary labeled examples that are not necessarily separable by convex combinations of base hypotheses....
CCCG
2003
13 years 7 months ago
2003
Given a convex polygon in the plane, we are interested in triangulations of its interior, i.e. maximal sets of nonintersecting diagonals that subdivide the interior of the polygon...
Lecture Notes
These lecture notes cover several topics such as Topological Space, Metric Space, Convex Sets, Correspondences, Maximum Theorem, KKM Theorem, Existence of Maximal Element, Selectio...
SAGT
2010
Springer
13 years 4 months ago
2010
Springer
The solution to a Nash or a nonsymmetric bargaining game is obtained by maximizing a concave function over a convex set, i.e., it is the solution to a convex program. We show that...