We characterize all limit laws of the quicksort type random variables defined recursively by Xn d = XIn + X n-1-In + Tn when the "toll function" Tn varies and satisfies ...
Model-based clustering of motion trajectories can be posed as the problem of learning an underlying mixture density function whose components correspond to motion classes with dif...
To exploit the similarity information hidden in the hyperlink structure of the web, this paper introduces algorithms scalable to graphs with billions of vertices on a distributed ...
We introduce Multi-Trials, a new technique for symmetry breaking for distributed algorithms and apply it to various problems in general graphs. For instance, we present three rand...
In this paper, we present a scheme for minimizing packet loss in OSPF networks by optimizing link weights using Online Simulation. We have chosen packet loss rate in the network a...
Hema Tahilramani Kaur, Tao Ye, Shivkumar Kalyanara...