425 search results - page 64 / 85 » A Fully Dynamic Algorithm for Distributed Shortest Paths |
ACMICEC
2004
ACM
14 years 1 months ago
2004
ACM
This paper presents a loosely coupled service-composition paradigm. This paradigm employs a distributed data flow that differs markedly from centralized information flow adopted b...
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...
WWW
2009
ACM
14 years 8 months ago
2009
ACM
Mobile social network is a typical social network where one or more individuals of similar interests or commonalities, conversing and connecting with one another using the mobile ...
ANSS
2006
IEEE
14 years 1 months ago
2006
IEEE
There has been a lot research effort on developing reactive routing algorithms for mobile ad hoc networks (MANETs) over the past few years. Most of these algorithms consider findi...
INFOCOM
2002
IEEE
14 years 14 days ago
2002
IEEE
— Directional antennas can be useful in significantly increasing node and network lifetime in wireless ad hoc networks. In order to utilize directional antennas, an algorithm is ...