724 search results - page 1 / 145 » Practical Performance of Efficient Minimum Cut Algorithms |
ALGORITHMICA
2000
13 years 5 months ago
2000
CVPR
1998
IEEE
14 years 7 months ago
1998
IEEE
Markov Random Fields (MRF's) can be used for a wide variety of vision problems. In this paper we focus on MRF's with two-valued clique potentials, which form a generaliz...
ECCV
2008
Springer
14 years 3 months ago
2008
Springer
There are many local and greedy algorithms for energy minimization over Markov Random Field (MRF) such as iterated condition mode (ICM) and various gradient descent methods. Local ...
WEA
2007
Springer
13 years 11 months ago
2007
Springer
The degree-constrained minimum spanning tree (DCMST) is relevant in the design of networks. It consists of finding a spanning tree whose nodes do not exceed a given maximum degree...
CIKM
2006
Springer
13 years 9 months ago
2006
Springer
In practical classification, there is often a mix of learnable and unlearnable classes and only a classifier above a minimum performance threshold can be deployed. This problem is...