7 search results - page 1 / 2 » Maximum Matchings via Gaussian Elimination |
ESA
2004
Springer
13 years 10 months ago
2004
Springer
We present a randomized algorithm for finding maximum matchings in planar graphs in time O(nω/2 ), where ω is the exponent of the best known matrix multiplication algorithm. Sin...
FOCS
2004
IEEE
13 years 8 months ago
2004
IEEE
ICDM
2010
IEEE
13 years 2 months ago
2010
IEEE
Abstract--Most well-known discriminative clustering models, such as spectral clustering (SC) and maximum margin clustering (MMC), are non-Bayesian. Moreover, they merely considered...
CVPR
2007
IEEE
14 years 6 months ago
2007
IEEE
This paper presents robust click-point linking: a novel localized registration framework that allows users to interactively prescribe where the accuracy has to be high. By emphasi...
CAIP
1999
Springer
13 years 9 months ago
1999
Springer
This paper casts the problem of point-set alignment via Procrustes analysis into a maximum likelihood framework using the EM algorithm. The aim is to improve the robustness of the...