422 search results - page 81 / 85 » Shortest paths between shortest paths and independent sets |
IDMS
2000
Springer
14 years 5 days ago
2000
Springer
Abstract. In this paper, we propose static and dynamic server selection techniques for multicast receivers who receive multiple streams from replicated servers. In the proposed sta...
MST
2010
13 years 3 months ago
2010
We consider triply-nested loops of the type that occur in the standard Gaussian elimination algorithm, which we denote by GEP (or the Gaussian Elimination Paradigm). We present tw...
SIGMETRICS
2011
ACM
12 years 11 months ago
2011
ACM
Opportunistic routing aims to improve wireless performance by exploiting communication opportunities arising by chance. A key challenge in opportunistic routing is how to achieve ...
SENSYS
2006
ACM
14 years 2 months ago
2006
ACM
Computing and maintaining network structures for efficient data aggregation incurs high overhead for dynamic events where the set of nodes sensing an event changes with time. Mor...
CIKM
2007
Springer
14 years 17 days ago
2007
Springer
We investigate the problem of how to evaluate, fast and efficiently, classes of optimal route queries on a massive graph in a unified framework. To evaluate a route query effectiv...