455 search results - page 8 / 91 » A local approximation algorithm for maximum weight matching |
ISAAC
2004
Springer
15 years 3 months ago
2004
Springer
We study complexity and approximation of min weighted node coloring in planar, bipartite and split graphs. We show that this problem is NP-complete in planar graphs, even if they a...
CANDC
2006
ACM
14 years 9 months ago
2006
ACM
On the basis of maximum weighted matching (MWM) algorithm, we introduced a dynamic weight related with stem length and used a recursive algorithm to predict RNA secondary structur...
103
click to vote
ECML
2006
Springer
15 years 1 months ago
2006
Springer
We present a new class of perceptron-like algorithms with margin in which the "effective" learning rate, defined as the ratio of the learning rate to the length of the we...
CORR
2007
Springer
14 years 9 months ago
2007
Springer
— Max-product belief propagation is a local, iterative algorithm to find the mode/MAP estimate of a probability distribution. While it has been successfully employed in a wide v...
ESA
2004
Springer
15 years 3 months ago
2004
Springer
