Self-stabilizing token circulation algorithms are not always adapted for dynamic networks. Random walks are well known to play a crucial role in the design of randomized algorithm...
We consider efficient real-time communication mechanisms for applications in unreliable and partitionable networks, where network partitions can occur unpredictably and nodes can ...
We propose a framework for general multiple target tracking, where the input is a set of candidate regions in each frame, as obtained from a state of the art background learning, ...
The Internet is an extremely complex system, and it is essential that we be able to make accurate measurements in order to understand its underlying behavior or to detect improper...
Alden W. Jackson, Walter C. Milliken, Cesar A. San...
The simplicity and robustness of unstructured P2P system make it a preferable architecture for constructing real large scale file sharing system. Most of the existing paradigms re...