Sciweavers

2695 search results - page 67 / 539
» Learning Graph Matching
Sort
View
CVPR
2004
IEEE
16 years 6 months ago
Window-Based, Discontinuity Preserving Stereo
Traditionally, the problem of stereo matching has been addressed either by a local window-based approach or a dense pixel-based approach using global optimization. In this paper, ...
Motilal Agrawal, Larry S. Davis
APPML
2007
57views more  APPML 2007»
15 years 4 months ago
On plane bipartite graphs without fixed edges
-An edge of a graph H with a perfect matching is a fixed edge if it either belongs to none or to all of the perfect matchings of H. It is shown that a connected plane bipartite gra...
Khaled Salem, Sandi Klavzar
CORR
2010
Springer
137views Education» more  CORR 2010»
15 years 4 months ago
Local algorithms in (weakly) coloured graphs
A local algorithm is a distributed algorithm that completes after a constant number of synchronous communication rounds. We present local approximation algorithms for the minimum ...
Matti Åstrand, Valentin Polishchuk, Joel Ryb...
ICASSP
2009
IEEE
15 years 10 months ago
Fingerprint matching based on distance metric learning
This paper considers a method for learning a distance metric in a fingerprinting system which identifies a query content by measuring the distance between the fingerprint of th...
Dalwon Jang, Chang D. Yoo
ICALT
2003
IEEE
15 years 9 months ago
Using Gestures to Learn about Graphs: The Contribution of Multimodal Technology
This paper describes a study that investigates the use of a multimodal technology in a learning task. In relation to the recent interest in learning as a multimodal experience, th...
Stamatina Anastopoulou, Mike Sharples, Chris Baber