2695 search results - page 15 / 539 » Learning Graph Matching |
ICPR
2006
IEEE
16 years 23 days ago
2006
IEEE
This paper exploits the properties of the commute time for the purposes of graph matching. Our starting point is the random walk on the graph, which is determined by the heat-kern...
94
Voted
GBRPR
2009
Springer
15 years 6 months ago
2009
Springer
We present an algorithm for graph matching in a pattern recognition context. This algorithm deals with weighted graphs, based on new structural and topological node signatures. Usi...
73
Voted
STOC
1993
ACM
15 years 3 months ago
1993
ACM
We consider a class of routing problems on connected graphs G. Initially, each vertex v of G is occupied by a “pebble” which has a unique destination π(v) in G (so that π is...
104
Voted
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Abstract Consider a random graph model where each possible edge e is present independently with some probability pe. Given these probabilities, we want to build a large/heavy match...
111
click to vote
ACSC
2005
IEEE
15 years 5 months ago
2005
IEEE
A k-separated matching in a graph is a set of edges at distance at least k from one another (hence, for instance, a 1-separated matching is just a matching in the classical sense)...