We present a randomized EREW PRAM algorithm to nd a minimum spanning forest in a weighted undirected graph. On an n-vertex graph the algorithm runs in o((logn)1+ ) expected time f...
In order to develop intelligent systems that attain the trust of their users, it is important to understand how users perceive such systems and develop those perceptions over time...
Joe Tullio, Anind K. Dey, Jason Chalecki, James Fo...
We address the problem of registering a sequence of images in a moving dynamic texture video. This involves optimization with respect to camera motion, the average image, and the ...
Abstract. Many parallel scienti c applications have dynamic and irregular computational structure. However, most such applications exhibit persistence of computational load and com...
Milind A. Bhandarkar, Robert Brunner, Laxmikant V....
In the Grid computing model a remote service is provided by a resource owner to a client. The resource owner executes a client job and charges the client for a corresponding fee. I...
Luigi Catuogno, Pompeo Faruolo, Umberto Ferraro Pe...