774 search results - page 22 / 155 » Markov incremental constructions |
LICS
2003
IEEE
14 years 2 months ago
2003
IEEE
This paper reports on and discusses three notions of approximation for Labelled Markov Processes that have been developed last year. The three schemes are improvements over former...
ATVA
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. Dynamic fault trees (DFTs) are a versatile and common formalism to model and analyze the reliability of computer-based systems. This paper presents a formal semantics of ...
SODA
2010
ACM
14 years 6 months ago
2010
ACM
We study the computational complexity of some central analysis problems for One-Counter Markov Decision Processes (OC-MDPs), a class of finitely-presented, countable-state MDPs. O...
CVPR
2006
IEEE
14 years 11 months ago
2006
IEEE
We consider the problem of computing the likelihood of a gesture from regular, unaided video sequences, without relying on perfect segmentation of the scene. Instead of requiring ...
RT
2005
Springer
14 years 2 months ago
2005
Springer
We present a system for interactively capturing, constructing, and rendering surface light fields by incrementally building a low rank approximation to the surface light field. ...