2219 search results - page 195 / 444 » Dynamic Programming and Graph Algorithms in Computer Vision |
143
click to vote
ISPA
2007
Springer
15 years 9 months ago
2007
Springer
The number of processors embedded in high performance computing platforms is growing daily to solve larger and more complex problems. The logical network topologies must also suppo...
133
click to vote
APCSAC
2003
IEEE
15 years 8 months ago
2003
IEEE
This paper introduces a method which can be used to map applications written in a high level source language program, like C, to a coarse grain reconfigurable architecture, MONTIU...
132
click to vote
GD
2003
Springer
15 years 8 months ago
2003
Springer
A drawing of a family of cuts of a graph is an augmented drawing of the graph such that every cut in the family is represented by a simple closed curve and vice versa. We show tha...
120
click to vote
CDC
2009
IEEE
15 years 7 months ago
2009
IEEE
— The problem of finding an optimal path in an uncertain graph arises in numerous applications, including network routing, path-planning for vehicles, and the control of finite...
139
click to vote
IPPS
2006
IEEE
15 years 9 months ago
2006
IEEE
Protein sequences with unknown functionality are often compared to a set of known sequences to detect functional similarities. Efficient dynamic programming algorithms exist for t...