619 search results - page 23 / 124 » Random Bichromatic Matchings |
138
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
We study Maker-Breaker games played on the edge set of a random graph. Specifically, we consider the random graph process and analyze the first time in a typical random graph proc...
150
click to vote
CVPR
2005
IEEE
16 years 7 months ago
2005
IEEE
A new robust matching method is proposed. The Progressive Sample Consensus (PROSAC) algorithm exploits the linear ordering defined on the set of correspondences by a similarity fu...
146
click to vote
CVPR
2007
IEEE
16 years 7 months ago
2007
IEEE
Matching local features across images is often useful when comparing or recognizing objects or scenes, and efficient techniques for obtaining image-to-image correspondences have b...
140
Voted
CSB
2003
IEEE
15 years 10 months ago
2003
IEEE
The design of large scale DNA microarrays is a challenging problem. So far, probe selection algorithms must trade the ability to cope with large scale problems for a loss of accur...
154
click to vote
CORR
2008
Springer
15 years 5 months ago
2008
Springer
We present a deterministic way of assigning small (log bit) weights to the edges of a bipartite planar graph so that the minimum weight perfect matching becomes unique. The isolati...