2219 search results - page 272 / 444 » Dynamic Programming and Graph Algorithms in Computer Vision |
135
click to vote
EMMCVPR
2005
Springer
15 years 8 months ago
2005
Springer
We present a novel approach to the matching of subgraphs for object recognition in computer vision. Feature similarities between object model and scene graph are complemented with ...
136
click to vote
ICVS
2009
Springer
15 years 29 days ago
2009
Springer
This paper introduces a system that automatically classifies registration problems based on the type of registration required. Rather than rely on a single "best" algorit...
139
click to vote
WEA
2007
Springer
15 years 9 months ago
2007
Springer
For trunk packing problems only few approximation schemes are known, mostly designed for the European standard DIN 70020 [6] with equally sized boxes [8, 9, 11, 12]. In this paper ...
117
click to vote
ICCSA
2004
Springer
15 years 8 months ago
2004
Springer
The algorithmic techniques which allow high efficiency in the precise calculation of the reliability of an undirected graph with absolutely reliable nodes and unreliable edges are ...
129
click to vote
DAC
2005
ACM
15 years 5 months ago
2005
ACM
Layout parasitics have great impact on analog circuit performance. This paper presents an algorithm for explicit parasitic control during layout retargeting of analog integrated c...