We introduce a polynomial-time algorithm to learn Bayesian networks whose structure is restricted to nodes with in-degree at most k and to edges consistent with the optimal branch...
Abstract. Monitoring large distributed concurrent systems is a challenging task. In this paper we formulate (model-based) diagnosis by means of hidden state history reconstruction,...
Abstract. We present a formalism for modeling replication in a distributed system with concurrent users sharing information. It is based on actions, which represent operations requ...
Marc Shapiro, Karthikeyan Bhargavan, Nishith Krish...
The present work investigates the structural and dynamical properties of aNobii1 , a social bookmarking system designed for readers and book lovers. Users of aNobii provide informa...
Luca Maria Aiello, Alain Barrat, Ciro Cattuto, Gia...
We consider the problem of optimal probing of states of a channel by transmitter and receiver for maximizing rate of reliable communication. The channel is discrete memoryless (DM...
Himanshu Asnani, Haim H. Permuter, Tsachy Weissman