In a Byzantine agreement protocol, a synchronous network of n interconnected processes of which t may be faulty, starts with an initial binary value associated with each process; a...
D. V. S. Ravikant, Muthuramakrishnan Venkitasubram...
We show a tight lower bound of (N log log N) on the number of transmission required to compute the parity of N bits (with constant error) in a network of N randomly placed sensors...
Chinmoy Dutta, Yashodhan Kanoria, D. Manjunath, Ja...
Video streams are ubiquitous in applications such as surveillance, games, and live broadcast. Processing and analyzing these data is challenging because algorithms have to be effic...
In this paper, we argue that there is a need for an event-based middleware to build large-scale distributed systems. Existing publish/subscribe systems still have limitations comp...
In this paper, we study the communication characteristics of the CM-5 and the performance e ects of scheduling regular and irregular communication patterns on the CM-5. We conside...
Ravi Ponnusamy, Rajeev Thakur, Alok N. Choudhary, ...