32 search results - page 6 / 7 » On the complexity of cutting plane proofs using split cuts |
CAD
2008
Springer
13 years 6 months ago
2008
Springer
This paper presents a new method for evaluating boolean set operations between Binary Space Partition (BSP) trees. Our algorithm has many desirable features including both numeric...
ICML
2010
IEEE
13 years 7 months ago
2010
IEEE
We propose a novel boosting algorithm which improves on current algorithms for weighted voting classification by striking a better balance between classification accuracy and the ...
EMMCVPR
2001
Springer
13 years 10 months ago
2001
Springer
Abstract. Grouping is a global partitioning process that integrates local cues distributed over the entire image. We identify four types of pairwise relationships, attraction and r...
MP
1998
13 years 5 months ago
1998
We consider the polyhedral approach to solving the capacitated facility location problem. The valid inequalities considered are the knapsack, ow cover, e ective capacity, single d...
JAIR
2007
13 years 6 months ago
2007
Exact Max-SAT solvers, compared with SAT solvers, apply little inference at each node of the proof tree. Commonly used SAT inference rules like unit propagation produce a simpliï¬...