207 search results - page 16 / 42 » Unsupervised Learning for Graph Matching |
132
Voted
ECCV
2008
Springer
16 years 4 months ago
2008
Springer
We propose a graph-based semi-supervised symmetric matching framework that performs dense matching between two uncalibrated wide-baseline images by exploiting the results of sparse...
110
Voted
IJCAI
2007
15 years 3 months ago
2007
In this paper we revisit the classical NLP problem of prepositional phrase attachment (PPattachment). Given the pattern V −NP1−P −NP2 in the text, where V is verb, NP1 is a ...
117
Voted
ICML
2007
IEEE
16 years 3 months ago
2007
IEEE
By the term "quantization", we refer to the process of using quantum mechanics in order to improve a classical algorithm, usually by making it go faster. In this paper, ...
127
Voted
PAMI
2006
15 years 2 months ago
2006
High dimensional structured data such as text and images is often poorly understood and misrepresented in statistical modeling. The standard histogram representation suffers from ...
125
Voted
ACL
2010
15 years 7 days ago
2010
We describe a novel approach to unsupervised learning of the events that make up a script, along with constraints on their temporal ordering. We collect naturallanguage descriptio...