1578 search results - page 95 / 316 » Direct Routing: Algorithms and Complexity |
BROADNETS
2006
IEEE
14 years 2 months ago
2006
IEEE
— As the popularity of resource-constrained devices such as hand-held computers increases, a new network service offloading complex processing tasks towards computational resour...
ISAAC
2007
Springer
14 years 3 months ago
2007
Springer
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...
DAC
2003
ACM
14 years 9 months ago
2003
ACM
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...
SIGMOD
2011
ACM
12 years 11 months ago
2011
ACM
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...
JGAA
2006
13 years 8 months ago
2006
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...