46 search results - page 9 / 10 » Fully Dynamic Algorithms for Maintaining Shortest Paths Tree... |
HPCC
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. Nowadays, power consumption reduction techniques are being increasingly used in computer systems, and high-performance computing systems are not an exception. In particul...
STOC
2004
ACM
14 years 7 months ago
2004
ACM
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
TPDS
2008
13 years 7 months ago
2008
To construct an efficient overlay network, the information of underlay is important. We consider using end-to-end measurement tools such as traceroute to infer the underlay topolog...
SIAMSC
2010
13 years 2 months ago
2010
In this paper, we outline two improvements to the fast sweeping method to improve the speed of the method in general and more specifically in cases where the speed is changing rapi...
TPDS
2008
13 years 7 months ago
2008
Abstract-- Broadcast-based Peer-to-Peer (P2P) networks, including flat (e.g., Gnutella) and two-layer super-peer implementations (e.g., Kazaa), are extremely popular nowadays due t...