21 search results - page 1 / 5 » Helly Theorems and Generalized Linear Programming |
COMPGEOM
1993
ACM
13 years 9 months ago
1993
ACM
SIAMCOMP
2008
13 years 5 months ago
2008
Helly's theorem says that, if every d+1 elements of a given finite set of convex objects in Rd have a common point, there is a point common to all of the objects in the set. I...
ICALP
2009
Springer
14 years 5 months ago
2009
Springer
We consider graphical games in which edges are zero-sum games between the endpoints/players; the payoff of a player is the sum of the payoffs from each incident edge. We give a si...
PLDI
2011
ACM
12 years 8 months ago
2011
ACM
Program analysis and verification tools crucially depend on the ability to symbolically describe and reason about sets of program behaviors. Separation logic provides a promising...
TSP
2010
13 years 2 days ago
2010
This paper considers the downlink beamforming optimization problem that minimizes the total transmission power subject to global shaping constraints and individual shaping constrai...