604 search results - page 54 / 121 » On the Complexity of the Maximum Cut Problem |
118
click to vote
ECCV
2008
Springer
15 years 8 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 ...
STOC
2009
ACM
15 years 10 months ago
2009
ACM
This paper studies constant-time approximation algorithms for problems on degree-bounded graphs. Let n and d be the number of vertices and the degree bound, respectively. This pap...
120
click to vote
CVPR
2009
IEEE
16 years 4 months ago
2009
IEEE
We present a new method for classification with structured
latent variables. Our model is formulated using the
max-margin formalism in the discriminative learning literature.
We...
FOCS
2003
IEEE
15 years 3 months ago
2003
IEEE
We give a surprisingly short proof that in any planar arrangement of Ò curves where each pair intersects at most a fixed number (×) of times, the -level has subquadratic (Ç´...
SIROCCO
2010
14 years 11 months ago
2010
Abstract. We study strategies that minimize the instability of a faulttolerant consensus system. More precisely, we find the strategy than minimizes the number of output changes ov...