2219 search results - page 58 / 444 » Dynamic Programming and Graph Algorithms in Computer Vision |
115
click to vote
SIAMCOMP
2008
15 years 2 months ago
2008
The Graph Theorem of classical recursion theory states that a total function on the natural numbers is computable, if and only if its graph is recursive. It is known that this res...
134
click to vote
CSMR
2006
IEEE
15 years 8 months ago
2006
IEEE
A trace is a record of the execution of a computer program, showing the sequence of operations executed. A trace may be obtained through static or dynamic analysis. An object trac...
122
click to vote
ICCV
2009
IEEE
16 years 7 months ago
2009
IEEE
Markov Random Field is now ubiquitous in many formulations
of various vision problems. Recently, optimization
of higher-order potentials became practical using higherorder
graph...
112
click to vote
NETWORKS
2008
15 years 2 months ago
2008
Node pruning is a commonly used technique for solution acceleration in a dynamic programming network. In pruning, nodes are adaptively removed from the dynamic programming network...
124
click to vote
SIGSOFT
2003
ACM
16 years 2 months ago
2003
ACM
Program slicing is a technique to identify statements that may influence the computations at other statements. Precise slicing has been shown to be undecidable for concurrent prog...