— As the popularity of resource-constrained devices such as hand-held computers increases, a new network service offloading complex processing tasks towards computational resour...
Tim Stevens, Marc De Leenheer, Filip De Turck, Bar...
Social networks support efficient decentralized search: people can collectively construct short paths to a specified target in the network. Rank-based friendship—where the prob...
David Barbella, George Kachergis, David Liben-Nowe...
The classic algorithm for optimal buffer insertion due to van Ginneken has time and space complexity O(n2 ), where n is the number of possible buffer positions. We present a new a...
We study the problem of computing approximate quantiles in large-scale sensor networks communication-efficiently, a problem previously studied by Greenwald and Khana [12] and Shri...
We consider the problem of constructing a minimal cycle-breaking set of turns for a given undirected graph. This problem is important for deadlock-free wormhole routing in compute...
Lev B. Levitin, Mark G. Karpovsky, Mehmet Mustafa,...