2398 search results - page 215 / 480 » Constraint Programming and Graph Algorithms |
163
click to vote
STOC
1998
ACM
15 years 10 months ago
1998
ACM
Given an undirected graph with edge costs and a subset of k nodes called terminals, a multiway cut is a subset of edges whose removal disconnects each terminal from the rest. Mult...
166
click to vote
ENTCS
2008
15 years 6 months ago
2008
The satisfiability problem is the fundamental problem in proving the conflict-freeness of specifications, or in finding a counterexample for an invalid statement. In this paper, w...
166
click to vote
PPOPP
2005
ACM
16 years 1 days ago
2005
ACM
In this paper, we develop a new language construct to address one of the pitfalls of parallel programming: precise handling of events across parallel components. The construct, te...
124
click to vote
ICPR
2008
IEEE
16 years 7 months ago
2008
IEEE
A quadratic programming formulation for multiclass image segmentation is investigated. It is proved that, in the convex case, the non-negativity constraint on the recent reported ...
168
click to vote
EMMCVPR
2005
Springer
16 years 18 hour ago
2005
Springer
Abstract. Reverse-convex programming (RCP) concerns global optimization of a specific class of non-convex optimization problems. We show that a recently proposed model for sparse ...