We introduce the model of Markov nets, a probabilistic extension of safe Petri nets under the true-concurrency semantics--this means that traces, not firing sequences, are given a...
We present a process algebraic approach for extending to the probabilistic setting the classical logical information flow analysis of computer systems. In particular, we employ a ...
—We investigate the impact of the human driver behavior on Intelligent Transportation Systems (ITS). Motivated by early studies, which investigated the driver behavior and which ...
We revisit recently proposed algorithms for probabilistic clustering with pair-wise constraints between data points. We evaluate and compare existing techniques in terms of robust...
Algorithms for the sparse matrix-vector multiplication (shortly SpM×V ) are important building blocks in solvers of sparse systems of linear equations. Due to matrix sparsity, the...