2695 search results - page 12 / 539 » Learning Graph Matching |
87
Voted
ICPR
2010
IEEE
14 years 10 months ago
2010
IEEE
In this paper we propose a conductance electrical model to represent weighted undirected graphs that allows us to efficiently compute approximate graph isomorphism in large graph...
110
Voted
PVLDB
2010
14 years 10 months ago
2010
With the emergence of new applications, e.g., computational biology, new software engineering techniques, social networks, etc., more data is in the form of graphs. Locating occur...
115
Voted
ISAAC
2005
Springer
15 years 5 months ago
2005
Springer
In this paper, we deal with both the complexity and the approximability of the labeled perfect matching problem in bipartite graphs. Given a simple graph G = (V, E) with n vertices...
88
Voted
SIAMDM
2011
14 years 6 months ago
2011
For stable marriage (SM) and solvable stable roommates (SR) instances, it is known that there are stable matchings that assign each participant to his or her (lower/upper) median ...
202
Voted
ICDE
2002
IEEE
16 years 1 months ago
2002
IEEE
Matching elements of two data schemas or two data instances plays a key role in data warehousing, e-business, or even biochemical applications. In this paper we present a matching...