Abstract—We develop a family of distributed wireless scheduling algorithms that requires only O(1) complexity for M-hop interference model, for any finite M. The recent technolo...
A deadlock-free tree-based multicast routing algorithm is presented for all direct networks, regardless of interconnection topology. The algorithm delivers a message to any number...
Ran Libeskind-Hadas, Dominic Mazzoni, Ranjith Raja...
We propose a gossip-based distributed algorithm for Gaussian mixture learning, Newscast EM. The algorithm operates on network topologies where each node observes a local quantity ...
Abstract. In the frequency allocation problem we are given a cellular telephone network whose geographical coverage area is divided into cells where phone calls are serviced by fre...
Abstract-- The problem of finding the eigenvector corresponding to the largest eigenvalue of a stochastic matrix has numerous applications in ranking search results, multi-agent co...