253 search results - page 45 / 51 » Dynamic Trees and Dynamic Point Location |
USITS
2003
13 years 10 months ago
2003
In this paper, we argue that a broad range of large-scale network services would benefit from a scalable mechanism for delivering state about a random subset of global participan...
TON
2002
13 years 8 months ago
2002
Abstract-Dynamic routing protocols such as RIP and OSPF essentially implement distributed algorithms for solving the Shortest Paths Problem. The Border Gateway Protocol (BGP) is cu...
APPROX
2006
Springer
14 years 14 days ago
2006
Springer
For a given graph with weighted vertices, the goal of the minimum-weight dominating set problem is to compute a vertex subset of smallest weight such that each vertex of the graph...
SDM
2009
SIAM
14 years 5 months ago
2009
SIAM
This paper considers the problem of change detection using local distributed eigen monitoring algorithms for next generation of astronomy petascale data pipelines such as the Larg...
INFOCOM
2006
IEEE
14 years 2 months ago
2006
IEEE
— Many Peer-to-peer (P2P) applications such as media broadcasting and content distribution require a high performance overlay structure in order to deliver satisfying quality of ...