2219 search results - page 54 / 444 » Dynamic Programming and Graph Algorithms in Computer Vision |
147
click to vote
AOSD
2006
ACM
16 years 4 days ago
2006
ACM
OOP style requires programmers to organize their code according to objects (or nouns, using natural language as a metaphor), causing a program’s actions (verbs) to become scatte...
137
click to vote
ISVC
2007
Springer
16 years 9 days ago
2007
Springer
We formulate decomposition of two-dimensional shapes as a combinatorial optimization problem and present a dynamic programming algorithm that solves it.
153
click to vote
IPPS
2006
IEEE
16 years 6 days ago
2006
IEEE
Dynamically allocating computing nodes to parallel applications is a promising technique for improving the utilization of cluster resources. We introduce the concept of dynamic ef...
160
click to vote
SCAM
2003
IEEE
15 years 11 months ago
2003
IEEE
Many static analyses aim at assigning to each control point of a program an invariant property that characterizes any state of a trace corresponding to this point. The choice of t...
190
click to vote
COMGEO
1999
ACM
15 years 5 months ago
1999
ACM
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a directed graph having the points of S as its vertices, such that for any pair p and q o...