Sciweavers

1994 search results - page 118 / 399
» Computation of Optical Flow Using Dynamic Programming
Sort
View
EGH
2005
Springer
15 years 3 months ago
Optimal automatic multi-pass shader partitioning by dynamic programming
Complex shaders must be partitioned into multiple passes to execute on GPUs with limited hardware resources. Automatic partitioning gives rise to an NP-hard scheduling problem tha...
Alan Heirich
PAM
2005
Springer
15 years 3 months ago
Self-Learning IP Traffic Classification Based on Statistical Flow Characteristics
A number of key areas in IP network engineering, management and surveillance greatly benefit from the ability to dynamically identify traffic flows according to the applications re...
Sebastian Zander, Thuy T. T. Nguyen, Grenville J. ...
SPIN
2001
Springer
15 years 2 months ago
Addressing Dynamic Issues of Program Model Checking
Abstract. Model checking real programs has recently become an active research area. Programs however exhibit two characteristics that make model checking di cult: the complexity of...
Flavio Lerda, Willem Visser
ATAL
2009
Springer
15 years 4 months ago
Constraint-based dynamic programming for decentralized POMDPs with structured interactions
Decentralized partially observable MDPs (DEC-POMDPs) provide a rich framework for modeling decision making by a team of agents. Despite rapid progress in this area, the limited sc...
Akshat Kumar, Shlomo Zilberstein
CVIU
2008
109views more  CVIU 2008»
14 years 10 months ago
Performance vs computational efficiency for optimizing single and dynamic MRFs: Setting the state of the art with primal-dual st
In this paper we introduce a novel method to address minimization of static and dynamic MRFs. Our approach is based on principles from linear programming and, in particular, on pr...
Nikos Komodakis, Georgios Tziritas, Nikos Paragios