619 search results - page 14 / 124 » Random Bichromatic Matchings |
ACCV
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. In this paper, we propose an efficient method for finding consistent correspondences between two sets of features. Our matching algorithm augments the discriminative pow...
ICB
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Sweat pores on fingerprints have proven to be useful features for personal identification. Several methods have been proposed for pore matching. The state-of-the-art meth...
SIAMDM
2008
13 years 7 months ago
2008
An n-lift of a digraph K, is a digraph with vertex set V (K)
CORR
2010
Springer
13 years 7 months ago
2010
Springer
It is well known that a stable matching in a many-to-one matching market with couples need not exist. We introduce a new matching algorithm for such markets and show that for a ge...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
We give a fully polynomial randomized approximation scheme to compute a lower bound for the matching polynomial of any weighted graph at a positive argument. For the matching poly...