Sciweavers

2695 search results - page 98 / 539
» Learning Graph Matching
Sort
View
105
Voted
ICML
2007
IEEE
16 years 3 months ago
Constructing basis functions from directed graphs for value function approximation
Basis functions derived from an undirected graph connecting nearby samples from a Markov decision process (MDP) have proven useful for approximating value functions. The success o...
Jeffrey Johns, Sridhar Mahadevan
105
Voted
ICML
2008
IEEE
16 years 3 months ago
The skew spectrum of graphs
The central issue in representing graphstructured data instances in learning algorithms is designing features which are invariant to permuting the numbering of the vertices. We pr...
Risi Imre Kondor, Karsten M. Borgwardt
ECAI
2006
Springer
15 years 6 months ago
Discovering Missing Background Knowledge in Ontology Matching
Semantic matching determines the mappings between the nodes of two graphs (e.g., ontologies) by computing logical relations (e.g., subsumption) holding among the nodes that corresp...
Fausto Giunchiglia, Pavel Shvaiko, Mikalai Yatskev...
IAAI
2003
15 years 3 months ago
LAW: A Workbench for Approximate Pattern Matching in Relational Data
Pattern matching for intelligence organizations is a challenging problem. The data sets are large and noisy, and there is a flexible and constantly changing notion of what consti...
Michael Wolverton, Pauline Berry, Ian W. Harrison,...
CVPR
2009
IEEE
16 years 9 months ago
Stereo Matching with Nonparametric Smoothness Priors in Feature Space
We propose a novel formulation of stereo matching that considers each pixel as a feature vector. Under this view, matching two or more images can be cast as matching point clouds i...
Brandon M. Smith, Hailin Jin, Li Zhang