: The ability to estimate the communication latency between arbitrary hosts on the Internet would enable the distributed computing applications to find the closest server or to fin...
R. Vijayprasanth, R. Kavithaa, Rajkumar Kettimuthu
Grid technology has been widely used for large-scale computational problems, but it also provides a framework for running a big number of smallsized processes. Moreover, these proc...
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 ...
Marching Ridges is an algorithm for finding ridges of measurement functions defined for images, in which the ridges are defined as level sets of first derivatives of the measureme...
We propose optimal routing algorithms for Chord [1], a popular topology for routing in peer-to-peer networks. Chord is an undirected graph on 2b nodes arranged in a circle, with e...