185 search results - page 4 / 37 » A Simple Min Cut Algorithm |
Presentation
A detailed presentation by Yuri Boykov, Daniel Cremers, Vladimir Kolmogorov, at the European Conference on Computer Vision (ECCV) 2006, that shows the difference between local and ...
COCO
2005
Springer
14 years 1 months ago
2005
Springer
We show that the Multicut, Sparsest-Cut, and Min-2CNF≡ Deletion problems are NP-hard to approximate within every constant factor, assuming the Unique Games Conjecture of Khot [S...
WINET
2010
13 years 5 months ago
2010
We consider the problem of static transmission-power assignment for lifetime maximization of a wireless sensor network with stationary nodes operating in a data-gathering scenario...
ICPR
2008
IEEE
14 years 1 months ago
2008
IEEE
OneClassMaxMinOver (OMMO) is a simple incremental algorithm for one-class support vector classification. We propose several enhancements and heuristics for improving model select...
STOC
1998
ACM
13 years 11 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...