2695 search results - page 90 / 539 » Learning Graph Matching |
144
click to vote
ICML
2010
IEEE
15 years 3 months ago
2010
IEEE
Existing approaches to analyzing the asymptotics of graph Laplacians typically assume a well-behaved kernel function with smoothness assumptions. We remove the smoothness assumpti...
120
Voted
AAAI
2010
15 years 3 months ago
2010
We study propagation algorithms for the conjunction of two ALLDIFFERENT constraints. Solutions of an ALLDIFFERENT constraint can be seen as perfect matchings on the variable/value...
COLT
2003
Springer
15 years 7 months ago
2003
Springer
NJC
1998
15 years 2 months ago
1998
The problem of routing permutations on graphs via matchings is considered, and we present a general algorithm which can be parameterized by different heuristics. This leads to a ...
227
click to vote
ICDE
2005
IEEE
16 years 3 months ago
2005
IEEE
Schema Matching is the problem of identifying corresponding elements in different schemas. Discovering these correspondences or matches is inherently difficult to automate. Past s...