1056 search results - page 136 / 212 » Constraint-Based Graph Matching |
ECCV
2006
Springer
14 years 11 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...
STOC
2009
ACM
14 years 9 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...
ICCAD
2005
IEEE
14 years 6 months 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 ...
CRV
2008
IEEE
14 years 3 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-...
ACSC
2001
IEEE
14 years 24 days ago
2001
IEEE
This paper analyses the efficiency of different data structures for detecting overlap in digital documents. Most existing approaches use some hash function to reduce the space req...