2695 search results - page 246 / 539 » Learning Graph Matching |
139
Voted
GECCO
2010
Springer
15 years 8 months ago
2010
Springer
This paper argues that multiagent learning is a potential “killer application” for generative and developmental systems (GDS) because key challenges in learning to coordinate ...
131
Voted
ECCV
2006
Springer
16 years 5 months ago
2006
Springer
Abstract. Successful multi-target tracking requires solving two problems - localize the targets and label their identity. An isolated target's identity can be unambiguously pr...
146
Voted
STOC
2009
ACM
16 years 4 months ago
2009
ACM
This paper studies constant-time approximation algorithms for problems on degree-bounded graphs. Let n and d be the number of vertices and the degree bound, respectively. This pap...
120
Voted
ICCAD
2005
IEEE
16 years 17 days ago
2005
IEEE
Technology mapping based on DAG-covering suffers from the problem of structural bias: the structure of the mapped netlist depends strongly on the subject graph. In this paper we ...
144
Voted
CRV
2008
IEEE
15 years 10 months ago
2008
IEEE
Dense stereo algorithms rely on matching over a range of disparities. To speed up the search and reduce match ambiguity, processing can be embedded in the hierarchical, or coarse-...