Sciweavers

814 search results - page 28 / 163
» Graphical Models for Graph Matching
Sort
View
AAAI
2006
13 years 11 months ago
Inexact Matching of Ontology Graphs Using Expectation-Maximization
We present a new method for mapping ontology schemas that address similar domains. The problem of ontology mapping is crucial since we are witnessing a decentralized development a...
Prashant Doshi, Christopher Thomas
JMM2
2006
141views more  JMM2 2006»
13 years 10 months ago
Optimal Weighting of Landmarks for Face Recognition
A new method named Landmark Model Matching was recently proposed for fully automatic face recognition. It was inspired by Elastic Bunch Graph Matching and Active Shape Model. Landm...
Rajinda Senaratne, Saman K. Halgamuge
IPPS
1999
IEEE
14 years 2 months ago
Coarse Grained Parallel Maximum Matching In Convex Bipartite Graphs
We present a coarse grained parallel algorithm for computing a maximum matching in a convex bipartite graph G = A;B;E. For p processors with N=p memory per processor, N = jAj+jBj,...
Prosenjit Bose, Albert Chan, Frank K. H. A. Dehne,...
AMDO
2006
Springer
14 years 1 months ago
Matching Two-Dimensional Articulated Shapes Using Generalized Multidimensional Scaling
We present a theoretical and computational framework for matching of two-dimensional articulated shapes. Assuming that articulations can be modeled as near-isometries, we show an a...
Alexander M. Bronstein, Michael M. Bronstein, Alfr...
SIBGRAPI
2006
IEEE
14 years 4 months ago
Single Triangle Strip and Loop on Manifolds with Boundaries
The single triangle-strip loop generation algorithm on a triangulated two-manifold presented by Gopi and Eppstein [4] is based on the guaranteed existence of a perfect matching in...
Pablo Diaz-Gutierrez, David Eppstein, M. Gopi