Sciweavers

2754 search results - page 2 / 551
» Distributed Weighted Matching
Sort
View
ICPP
1987
IEEE
15 years 1 months ago
Parallel Algorithm for Maximum Weight Matching in Trees
We present an efficient coarse grained parallel algorithm for computing a maximum weight matching in trees. A divide and conquer approach based on centroid decomposition of trees ...
Shaunak Pawagi
CORR
2007
Springer
128views Education» more  CORR 2007»
14 years 9 months ago
Equivalence of LP Relaxation and Max-Product for Weighted Matching in General Graphs
— 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...
Sujay Sanghavi
PPAM
2007
Springer
15 years 3 months ago
A Parallel Approximation Algorithm for the Weighted Maximum Matching Problem
Abstract. We consider the problem of computing a weighted edge matching in a large graph using a parallel algorithm. This problem has application in several areas of combinatorial ...
Fredrik Manne, Rob H. Bisseling
CVPR
2004
IEEE
15 years 1 months ago
Diffeomorphic Matching of Distributions: A New Approach for Unlabelled Point-Sets and Sub-Manifolds Matching
In the paper, we study the problem of optimal matching of two generalized functions (distributions) via a diffeomorphic transformation of the ambient space. In the particular case...
Joan Glaunes, Alain Trouvé, Laurent Younes
COCOON
2007
Springer
15 years 3 months ago
Distributed Approximation Algorithms for Weighted Problems in Minor-Closed Families
We give efficient distributed approximation algorithms for weighted versions of the maximum matching problem and the minimum dominating set problem for graphs from minor-closed fam...
Andrzej Czygrinow, Michal Hanckowiak