425 search results - page 49 / 85 » A Fully Dynamic Algorithm for Distributed Shortest Paths |
MASCOTS
2004
13 years 10 months ago
2004
Unstructured peer-to-peer (P2P) system is the prevalent model in today's P2P system. In such systems, a response is sent along the same path that carried the incoming query m...
IPPS
2003
IEEE
14 years 2 months ago
2003
IEEE
— We consider the problem of maintaining routing paths between nodes in a dynamic network. Gafni and Bertsekas proposed a link reversal approach called the BG method that maintai...
MASS
2010
13 years 6 months ago
2010
Abstract--In a delay tolerant network (DTN), nodes are connected intermittently and the future node connections are mostly unknown. Since in these networks, a fully connected path ...
HPDC
2005
IEEE
14 years 2 months ago
2005
IEEE
good data partitioning scheme is the need of the time. However it is very diflcult to arrive at a good solution as the number of possible dutupartitionsfor a given real lifeprogra...
MM
2005
ACM
14 years 2 months ago
2005
ACM
To locate a video clip in large collections is very important for retrieval applications, especially for digital rights management. In this paper, we present a novel technique for...