985 search results - page 30 / 197 » Piercing Convex Sets |
SAGT
2010
Springer
13 years 6 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...
SOFSEM
1998
Springer
13 years 12 months ago
1998
Springer
Abstract. The problem of reconstructing a discrete set from its horizontal and vertical projections (RSP) is of primary importance in many different problems for example pattern re...
JC
2007
13 years 7 months ago
2007
We study the problem of discrepancy of finite point sets in the unit square with respect to convex polygons, when the directions of the edges are fixed, when the number of edges ...
FSS
2008
13 years 7 months ago
2008
The algebra of truth values of type-2 fuzzy sets is the set of all functions from the unit interval into itself, with operations de ned in terms of certain convolutions of these f...
CCCG
2006
13 years 9 months ago
2006
We consider the problem of removing c points from a set S of n points so that the resulting point set has the smallest possible convex hull. Our main result is an O n 4c 2c (3c)c +...