16404 search results - page 897 / 3281 » A set coverage problem |
197
click to vote
SIAMCOMP
2010
15 years 2 months ago
2010
The (undirected) Steiner Network problem is: given a graph = ( , ) with edge/node-weights and edge-connectivity requirements { ( , ) : , }, find a minimumweight subgraph of conta...
231
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
One can reduce the problem of proving that a polynomial is nonnegative, or more generally of proving that a system of polynomial inequalities has no solutions, to finding polynomi...
235
click to vote
CVPR
2011
IEEE
14 years 11 months ago
2011
IEEE
Modeling data by multiple low-dimensional planes is an important problem in many applications such as computer vision and pattern recognition. In the most general setting where on...
361
Voted
AMW
2011
14 years 11 months ago
2011
Abstract. We consider the problem of checking equivalence of conjunctive queries with inequalities under bag (multiset) semantics. The problem is known to be decidable in pspace an...
248
Voted
CPAIOR
2011
Springer
14 years 11 months ago
2011
Springer
Abstract. We study the application of limited-width MDDs (multivalued decision diagrams) as discrete relaxations for combinatorial optimization problems. These relaxations are used...