— We develop distributed scheduling schemes that are based on simple random access algorithms and that have no message passing. In spite of their simplicity, these schemes are sh...
—Oja’s principal subspace algorithm is a well-known and powerful technique for learning and tracking principal information in time series. A thorough investigation of the conve...
Broder et al.’s [3] shingling algorithm and Charikar’s [4] random projection based approach are considered “state-of-theart” algorithms for finding near-duplicate web pag...
This paper describes a parallel algorithm for correlating or “fusing” streams of data from sensors and other sources of information. The algorithm is useful for applications w...
In this paper, a new algorithm to route traffic efficiently is proposed. The proposed algorithm finds additional routes to the destination and identifies the critical links in the...