A 3D super-resolution algorithm is proposed below, based on a probabilistic interpretation of the ndimensional version of Papoulis' generalized sampling theorem. The algorith...
Hassan Shekarforoush, Marc Berthod, Josiane Zerubi...
act We show how to modelize concurrency between several processors in terms of automata and Markov chains; then, we define a concurrency measure which reflects more faithfully the ...
Although a partially observable Markov decision process (POMDP) provides an appealing model for problems of planning under uncertainty, exact algorithms for POMDPs are intractable...
The analysis of discrete stochastic models such as generally distributed stochastic Petri nets can be done using state space-based methods. The behavior of the model is described ...
Abstract. Monolithic finite-state probabilistic programs have been abstractly modeled by finite Markov chains, and the algorithmic verification problems for them have been inves...