4469 search results - page 206 / 894 » Dynamic Program Slicing |
ECCV
2000
Springer
14 years 10 months ago
2000
Springer
This paper focuses on matching 1D structures by variational methods. We provide rigorous rules for the construction of the cost function, on the basis of an analysis of properties ...
FPGA
1995
ACM
13 years 11 months ago
1995
ACM
This paper considers the problem of partitioning a circuit into a collection of subcircuits, such that each subcircuit is feasible for some device from an FPGA library, and the to...
IR
2008
13 years 8 months ago
2008
We develop efficient dynamic programming algorithms for pattern matching with general gaps and character classes. We consider patterns of the form p0g(a0, b0)p1g(a1, b1) . . . pm-1...
IPL
2007
13 years 8 months ago
2007
The MIN algorithm is an offline strategy for deciding which item to replace when writing a new item to a cache. Its optimality was first established by Mattson, Gecsei, Slutz, a...
MOR
2010
13 years 6 months ago
2010
We explicitly solve the optimal switching problem for one-dimensional diffusions by directly employing the dynamic programming principle and the excessive characterization of the ...