588 search results - page 11 / 118 » A Fast Distributed Algorithm for Approximating the Maximum M... |
107
click to vote
STACS
2004
Springer
15 years 7 months ago
2004
Springer
We present an improved average case analysis of the maximum cardinality matching problem. We show that in a bipartite or general random graph on n vertices, with high probability ...
109
click to vote
IPPS
1999
IEEE
15 years 6 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,...
134
click to vote
APPROX
2004
Springer
15 years 7 months ago
2004
Springer
ABSTRACT: Let G(n, c/n) and Gr(n) be an n-node sparse random graph and a sparse random rregular graph, respectively, and let I(n, r) and I(n, c) be the sizes of the largest indepen...
140
click to vote
ECCV
2002
Springer
16 years 4 months ago
2002
Springer
We investigate in this article the rigid registration of large sets of points, generally sampled from surfaces. We formulate this problem as a general Maximum-Likelihood (ML) estim...
107
click to vote
SIGIR
1998
ACM
15 years 6 months ago
1998
ACM
Abstract We present a fast compression and decompression scheme for natural language texts that allows e cient and exible string matching by searching the compressed text directly....