2695 search results - page 193 / 539 » Learning Graph Matching |
173
click to vote
DAM
2006
15 years 7 months ago
2006
Given a rectangular array where entries represent the pixels of a digitalized image, we consider the problem of reconstructing an image from the number of occurrences of each colo...
197
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We obtain new lower and upper bounds for the maximum multiplicity of some weighted and, respectively, non-weighted common geometric graphs drawn on n points in the plane in genera...
191
click to vote
CORR
2011
Springer
15 years 2 months ago
2011
Springer
We describe a new variational lower-bound on the minimum energy configuration of a planar binary Markov Random Field (MRF). Our method is based on adding auxiliary nodes to every...
165
click to vote
WCRE
2007
IEEE
16 years 1 months ago
2007
IEEE
Dynamic protocol recovery tries to recover a component’s sequencing constraints by means of dynamic analysis. This problem has been tackled by several automaton learning approac...
221
click to vote
WEBI
2010
Springer
15 years 4 months ago
2010
Springer
In this paper, we propose a Relation Expansion framework, which uses a few seed sentences marked up with two entities to expand a set of sentences containing target relations. Duri...