Sciweavers

2695 search results - page 44 / 539
» Learning Graph Matching
Sort
View
ICIP
2005
IEEE
16 years 3 months ago
Exploiting discriminant information in elastic graph matching
In this paper, we investigate the use of discriminant techniques in the elastic graph matching (EGM) algorithm. First we use discriminant analysis in the feature vectors of the no...
Stefanos Zafeiriou, Anastasios Tefas, Ioannis Pita...
153
Voted
TIT
2011
209views more  TIT 2011»
14 years 9 months ago
Belief Propagation and LP Relaxation for Weighted Matching in General Graphs
Loopy belief propagation has been employed in a wide variety of applications with great empirical success, but it comes with few theoretical guarantees. In this paper we analyze t...
Sujay Sanghavi, Dmitry M. Malioutov, Alan S. Wills...
JGT
2006
97views more  JGT 2006»
15 years 1 months ago
Matchings in hypergraphs of large minimum degree
It is well known that every bipartite graph with vertex classes of size n whose minimum degree is at least n/2 contains a perfect matching. We prove an analogue of this result for...
Daniela Kühn, Deryk Osthus
CORR
2011
Springer
243views Education» more  CORR 2011»
14 years 9 months ago
Localization from Incomplete Noisy Distance Measurements
—We consider the problem of positioning a cloud of points in the Euclidean space Rd , from noisy measurements of a subset of pairwise distances. This task has applications in var...
Adel Javanmard, Andrea Montanari
CORR
2007
Springer
109views Education» more  CORR 2007»
15 years 1 months ago
Graph rigidity, Cyclic Belief Propagation and Point Pattern Matching
—A recent paper [1] proposed a provably optimal polynomial time method for performing near-isometric point pattern matching by means of exact probabilistic inference in a chordal...
Julian John McAuley, Tibério S. Caetano, Ma...