Sciweavers

619 search results - page 35 / 124
» Random Bichromatic Matchings
Sort
View
CVPR
2007
IEEE
14 years 10 months ago
Efficient Sampling of Disparity Space for Fast And Accurate Matching
A simple stereo matching algorithm is proposed that visits only a small fraction of disparity space in order to find a semi-dense disparity map. It works by growing from a small s...
Jan Cech, Radim Sára

Publication
216views
14 years 1 months ago
Dynamic Matching with a Fall-Back Option
We study dynamic matching without money when one side of the market is dynamic with arrivals and de- partures and the other is static and agents have strict prefer- ences over a...
Sujit Gujar, David Parkes
COCO
1998
Springer
123views Algorithms» more  COCO 1998»
14 years 1 months ago
Isolation, Matching, and Counting
We show that the perfect matching problem is in the complexity class SPL in the nonuniform setting. This provides a better upper bound on the complexity of the matching problem, a...
Eric Allender, Klaus Reinhardt
PR
2006
116views more  PR 2006»
13 years 8 months ago
Correspondence matching using kernel principal components analysis and label consistency constraints
This paper investigates spectral approaches to the problem of point pattern matching. We make two contributions. First, we consider rigid point-set alignment. Here we show how ker...
Hongfang Wang, Edwin R. Hancock
ICDE
2008
IEEE
117views Database» more  ICDE 2008»
14 years 10 months ago
Mining Search-Phrase Definitions from Item Descriptions
In this paper, we develop a model for representing term dependence based on Markov Random Fields and present an approach based on Markov Chain Monte Carlo technique for generating ...
Hung V. Nguyen, Hasan Davulcu