398 search results - page 23 / 80 » Ant Algorithm for the Graph Matching Problem |
102
click to vote
FOCS
2008
IEEE
15 years 4 months ago
2008
IEEE
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...
TIT
2008
14 years 9 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...
ISAAC
1998
Springer
15 years 1 months ago
1998
Springer
In this paper we present a randomized parallel algorithm to sample matchings from an almost uniform distribution on the set of matchings of all sizes in a graph. First we prove th...
106
click to vote
ICASSP
2010
IEEE
14 years 9 months ago
2010
IEEE
We present a novel framework based on hidden Markov models (HMMs) for matching feature point sets, which capture the shapes of object contours of interest. Point matching algorith...
101
click to vote
WADS
1993
Springer
15 years 1 months ago
1993
Springer
The Minimum Weight Euclidean Matching (MWEM) problem is: given 2n point sites in the plane with Euclidean metric for interpoint distances, match the sites into n pairs so that the...