Sciweavers

2695 search results - page 89 / 539
» Learning Graph Matching
Sort
View
BTW
2007
Springer
123views Database» more  BTW 2007»
15 years 8 months ago
Matching Metamodels with Semantic Systems - An Experience Report
: Ontology and schema matching are well established techniques, which have been applied in various integration scenarios, e.g., web service composition and database integration. Co...
Gerti Kappel, Horst Kargl, Gerhard Kramler, Andrea...
CORR
2006
Springer
151views Education» more  CORR 2006»
15 years 2 months ago
Graph Laplacians and their convergence on random neighborhood graphs
Given a sample from a probability measure with support on a submanifold in Euclidean space one can construct a neighborhood graph which can be seen as an approximation of the subm...
Matthias Hein, Jean-Yves Audibert, Ulrike von Luxb...
DAM
2006
124views more  DAM 2006»
15 years 2 months ago
Coloring copoints of a planar point set
To a set of n points in the plane, one can associate a graph that has less than n2 vertices and has the property that k-cliques in the graph correspond vertex sets of convex k-gon...
Walter Morris
FOCS
2008
IEEE
15 years 9 months ago
Constant-Time Approximation Algorithms via Local Improvements
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...
Huy N. Nguyen, Krzysztof Onak
118
Voted
JMM2
2006
141views more  JMM2 2006»
15 years 2 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