273 search results - page 6 / 55 » Can Pure Cutting Plane Algorithms Work |
IMAMS
2007
13 years 9 months ago
2007
Decorative reliefs are widely used for e.g. packaging and porcelain design. In periodic reliefs, the relief repeats a pattern, for example all the way around an underlying surface...
ACCV
2009
Springer
14 years 2 months ago
2009
Springer
Graph cuts based interactive segmentation has become very popular over the last decade. In standard graph cuts, the extraction of foreground object in a complex background often le...
BIRTHDAY
2004
Springer
14 years 26 days ago
2004
Springer
Abstract. The logical and operational aspects of rewriting logic as a logical framework are tested and illustrated in detail by representing pure type systems as object logics. Mor...
ATAL
2010
Springer
13 years 8 months ago
2010
Springer
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
FOCS
2004
IEEE
13 years 11 months ago
2004
IEEE
Given an undirected multigraph G and a subset of vertices S V (G), the STEINER TREE PACKING problem is to find a largest collection of edge-disjoint trees that each connects S. T...