42 search results - page 7 / 9 » Optimal 3-terminal cuts and linear programming |
ICML
2010
IEEE
13 years 11 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 ...
ESA
2008
Springer
13 years 11 months ago
2008
Springer
The crossing number problem is to find the smallest number of edge crossings necessary when drawing a graph into the plane. Eventhough the problem is NP-hard, we are interested in ...
SARA
2009
Springer
14 years 4 months ago
2009
Springer
MINLP problems are hard constrained optimization problems, with nonlinear constraints and mixed discrete continuous variables. They can be solved using a Branch-and-Bound scheme c...
FSTTCS
2004
Springer
14 years 3 months ago
2004
Springer
Abstract Abstract. In this paper we improve the analysis of approximation algorithms based on semideļ¬nite programming for the maximum graph partitioning problems MAX-k-CUT, MAX-k...
PKDD
2009
Springer
14 years 4 months ago
2009
Springer
A frequent problem in density level-set estimation is the choice of the right features that give rise to compact and concise representations of the observed data. We present an eļ¬...