2695 search results - page 140 / 539 » Learning Graph Matching |
152
Voted
BMVC
2010
14 years 9 months ago
2010
Saliency detection is a well researched problem in computer vision. In previous work, most of the effort is spent on manually devising a saliency measure. Instead we propose a sim...
124
Voted
MST
2008
15 years 2 months ago
2008
Abstract. We outline a general theory of graph polynomials which covers all the examples we found in the vast literature, in particular, the chromatic polynomial, various generaliz...
147
Voted
SIGMOD
2011
ACM
14 years 5 months ago
2011
ACM
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
118
Voted
IDA
2007
Springer
15 years 2 months ago
2007
Springer
Graph grammars combine the relational aspect of graphs with the iterative and recursive aspects of string grammars, and thus represent an important next step in our ability to dis...
112
Voted
CVPR
2003
IEEE
16 years 4 months ago
2003
IEEE
In this paper, we address the stereo matching problem in the presence of reflections and translucency, where image formation can be modeled as the additive superposition of layers...