Abstract. We develop an algorithm to compute timed reachability probabilities for distributed models which are both probabilistic and nondeterministic. To obtain realistic results ...
Georgel Calin, Pepijn Crouzen, Pedro R. D'Argenio,...
Correspondence algorithms typically struggle with shapes that display part-based variation. We present a probabilistic approach that matches shapes using independent part transfor...
This work presents a novel people tracking approach, able to cope with frequent shape changes and large occlusions. In particular, the tracks are described by means of probabilist...
Rita Cucchiara, Costantino Grana, Giovanni Tardini...
Abstract. This paper proposes a statistical model of functional landmarks delimiting low level visual areas which are highly variable across individuals. Low level visual areas are...
Isabelle Corouge, Michel Dojat, Christian Barillot
- A gate level probabilistic error propagation model is presented which takes as input the Boolean function of the gate, the signal and error probabilities of the gate inputs, and ...