2695 search results - page 39 / 539 » Learning Graph Matching |
106
click to vote
3DIM
2005
IEEE
15 years 7 months ago
2005
IEEE
Automatic range image registration without any knowledge of the viewpoint requires identification of common regions across different range images and then establishing point corr...
121
click to vote
NIPS
2004
15 years 3 months ago
2004
Many machine learning algorithms for clustering or dimensionality reduction take as input a cloud of points in Euclidean space, and construct a graph with the input data points as...
EMNLP
2008
15 years 3 months ago
2008
We consider a parsed text corpus as an instance of a labelled directed graph, where nodes represent words and weighted directed edges represent the syntactic relations between the...
112
click to vote
SODA
1993
ACM
15 years 3 months ago
1993
ACM
We consider the performance of a simple greedy matching algorithm MINGREEDY when applied to random cubic graphs. We show that if λn is the expected number of vertices not matched...
103
click to vote
DM
2006
15 years 1 months ago
2006
The forcing number of a perfect matching M of a graph G is the cardinality of the smallest subset of M that is contained in no other perfect matching of G. In this paper, we demon...