We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
Both human users and crawlers face the problem of finding good start pages to explore some topic. We show how to assist in qualifying pages as start nodes by link-based ranking al...
Abstract. This paper deals with the problem of Blind Source Separation. Contrary to the vast majority of works, we do not assume the statistical independence between the sources an...
— In this paper, the problem of optimizing the performances of a distributed supply chain is faced by means of a decentralized architecture. In particular, a general scheme for a...
In this paper we extend the notion of k-anonymity in the context of databases with timestamped information in order to naturally define k-anonymous views of temporal data. We als...
Sergio Mascetti, Claudio Bettini, Xiaoyang Sean Wa...