1994 search results - page 110 / 399 » Computation of Optical Flow Using Dynamic Programming |
AI
2000
Springer
14 years 9 months ago
2000
Springer
Markov decisionprocesses(MDPs) haveproven to be popular models for decision-theoretic planning, but standard dynamic programming algorithms for solving MDPs rely on explicit, stat...
HPCA
2004
IEEE
15 years 10 months ago
2004
IEEE
Reducing energy consumption has become one of the major challenges in designing future computing systems. This paper proposes a novel idea of using program counters to predict I/O...
84
Voted
SPAA
2006
ACM
15 years 3 months ago
2006
ACM
Tree contraction algorithms, whose idea was first proposed by Miller and Reif, are important parallel algorithms to implement efficient parallel programs manipulating trees. Desp...
BROADNETS
2004
IEEE
15 years 1 months ago
2004
IEEE
We consider the maximization of network throughput in buffer-constrained optical networks using aggregate bandwidth allocation and reservation-based transmission control. Assuming...
ACSAC
2007
IEEE
15 years 4 months ago
2007
IEEE
We have implemented an information flow framework for the Java Virtual Machine that combines static and dynamic techniques to capture not only explicit flows, but also implicit ...