603 search results - page 51 / 121 » A General Approximation Technique for Constrained Forest Pro... |
118
click to vote
PAMI
2007
15 years 1 months ago
2007
A new framework is presented for both understanding and developing graph-cut based combinatorial algorithms suitable for the approximate optimization of a very wide class of MRFs ...
188
click to vote
IWPEC
2010
Springer
14 years 11 months ago
2010
Springer
The Colorful Motif problem asks if, given a vertex-colored graph G, there exists a subset S of vertices of G such that the graph induced by G on S is connected and contains every c...
113
click to vote
IPCO
2007
15 years 3 months ago
2007
Abstract. We consider the single machine scheduling problem to minimize the average weighted completion time under precedence constrains. Improving on the various 2-approximation a...
SIAMJO
2008
15 years 1 months ago
2008
This paper describes a Parallel Space Decomposition (PSD) technique for the Mesh Adaptive Direct Search (MADS) algorithm. MADS extends Generalized Pattern Search for constrained n...
108
click to vote
SIGECOM
2010
ACM
15 years 1 months ago
2010
ACM
Cut games and party affiliation games are well-known classes of potential games. Schaffer and Yannakakis showed that computing pure Nash equilibrium in these games is PLScomplete....