20 search results - page 1 / 4 » Contraction and Expansion of Convex Sets |
CCCG
2007
14 years 12 days ago
2007
Let S be a set system of convex sets in Rd . Helly’s theorem states that if all sets in S have empty intersection, then there is a subset S′ ⊂ S of size d+1 which also has e...
DCC
1999
IEEE
14 years 3 months ago
1999
IEEE
EJC
1998
13 years 10 months ago
1998
A hierarchy of classes of graphs is proposed which includes hypercubes, acyclic cubical complexes, median graphs, almost median graphs, premedian graphs and partial cubes. Structu...
WIOPT
2011
IEEE
13 years 2 months ago
2011
IEEE
—In this paper, we address the spectrum portfolio optimization (SPO) question in the context of secondary spectrum markets, where bandwidth (spectrum access rights) can be bought...
CVPR
2007
IEEE
15 years 29 days ago
2007
IEEE
Optimization with graph cuts became very popular in recent years. Progress in problems such as stereo correspondence, image segmentation, etc., can be attributed, in part, to the ...