2695 search results - page 375 / 539 » Learning Graph Matching |
146
click to vote
DISOPT
2010
15 years 3 months ago
2010
While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few studies abou...
122
click to vote
DISOPT
2008
15 years 3 months ago
2008
At present, the most successful approach to solving large-scale instances of the Symmetric Traveling Salesman Problem to optimality is branch-and-cut. The success of branch-and-cu...
113
click to vote
IJCPOL
2002
15 years 2 months ago
2002
The method to automatically extract translational Japanese-KATAKANA and English word pairs from bilingual corpora is proposed. The method applies all the existing transliteration ...
101
click to vote
COLING
2010
14 years 10 months ago
2010
Fact collections are mostly built using semi-supervised relation extraction techniques and wisdom of the crowds methods, rendering them inherently noisy. In this paper, we propose...
143
click to vote
CVPR
2008
IEEE
16 years 5 months ago
2008
IEEE
Accurate estimation of optical flow is a challenging task, which often requires addressing difficult energy optimization problems. To solve them, most top-performing methods rely ...