Sciweavers

2695 search results - page 118 / 539
» Learning Graph Matching
Sort
View
137
Voted
CVPR
2011
IEEE
14 years 10 months ago
Modeling the joint density of two images under a variety of transformations
We describe a generative model of the relationship between two images. The model is defined as a factored threeway Boltzmann machine, in which hidden variables collaborate to deļ...
Joshua Susskind, Roland Memisevic, Geoffrey Hinton...
118
Voted
ICIP
2008
IEEE
16 years 4 months ago
Spatiotemporal modeling and matching of video shots
In this paper, we propose a framework to model video sequences using spatiotemporal description of video shots. Spatiotemporal volumes are extracted thanks to an efficient segment...
Eric Galmar, Benoit Huet
102
Voted
ICPR
2002
IEEE
16 years 3 months ago
A Windowed Weighted Approach for Approximate Cyclic String Matching
A method for measuring dissimilarities between cyclic strings is introduced. It computes a weighted mean between two (lower and upper) bounds of the exact cyclic edit distance, wh...
Ramón Alberto Mollineda, Enrique Vidal, Fra...
121
Voted
SEMWEB
2007
Springer
15 years 8 months ago
SODA: an OWL-DL based Ontology Matching System
This paper describes SODA a novel ontology alignment method for the OWL-DL format. SODA uses a new approach that consists in computing local and semantic similarities among ontolog...
Sami Zghal, Sadok Ben Yahia, Engelbert Mephu Nguif...
112
Voted
CORR
2010
Springer
163views Education» more  CORR 2010»
15 years 27 days ago
Faster Algorithms for Semi-Matching Problems
We consider the problem of finding semi-matching in bipartite graphs which is also extensively studied under various names in the scheduling literature. We give faster algorithms ...
Jittat Fakcharoenphol, Bundit Laekhanukit, Danupon...