455 search results - page 39 / 91 » A local approximation algorithm for maximum weight matching |
MICCAI
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. Curves are often used as anatomical features to match surfaces that represent biological objects, such as the human brain. Automated and semi-automated methods for extrac...
ICASSP
2008
IEEE
15 years 4 months ago
2008
IEEE
In a reverberant scenario, phase transformed weighted algorithms are more robust than Maximum Likelihood (ML) because of the insufficiency of the data model to incorporate reverb...
80
Voted
JDA
2011
14 years 4 months ago
2011
It has recently been shown how to construct online, non-amortised approximate pattern matching algorithms for a class of problems whose distance functions can be classified as be...
ISAAC
2007
Springer
15 years 3 months ago
2007
Springer
The class of graphs where the size of a minimum vertex cover equals that of a maximum matching is known as K¨onig-Egerv´ary graphs. K¨onig-Egerv´ary graphs have been studied ex...
NIPS
1996
14 years 11 months ago
1996
Optimal Brain Damage (OBD) is a method for reducing the number of weights in a neural network. OBD estimates the increase in cost function if weights are pruned and is a valid app...