11 search results - page 1 / 3 » Dynamic Matchings in Convex Bipartite Graphs |
67
Voted
MFCS
2007
Springer
15 years 7 months ago
2007
Springer
98
Voted
IPPS
1999
IEEE
15 years 5 months ago
1999
IEEE
We present a coarse grained parallel algorithm for computing a maximum matching in a convex bipartite graph G = A;B;E. For p processors with N=p memory per processor, N = jAj+jBj,...
107
Voted
AAAI
2010
15 years 2 months ago
2010
We study propagation algorithms for the conjunction of two ALLDIFFERENT constraints. Solutions of an ALLDIFFERENT constraint can be seen as perfect matchings on the variable/value...
104
Voted
ICWS
2007
IEEE
15 years 2 months ago
2007
IEEE
The ability to dynamically discover and invoke a Web Service is a critical aspect of Service Oriented Architectures. An important component of the discovery process is the matchma...
108
Voted
TIT
2008
15 years 1 months ago
2008
Abstract--Max-product "belief propagation" (BP) is an iterative, message-passing algorithm for finding the maximum a posteriori (MAP) assignment of a discrete probability...