410 search results - page 56 / 82 » Upgrading Shortest Paths in Networks |
132
click to vote
ICC
2007
IEEE
15 years 7 months ago
2007
IEEE
— Without the multicast support from the underlying networks, overlay multicast has the advantage of implementing inter-domain multicast communications. Usually, overlay multicas...
108
click to vote
EMMCVPR
2003
Springer
15 years 6 months ago
2003
Springer
Common techniques for curve alignment find a solution in the form of a shortest network path by means of dynamic programming. In this paper we present an approach that employs Set...
105
click to vote
IPPS
2002
IEEE
15 years 6 months ago
2002
IEEE
This paper proposes a new distributed shortest path (SP) based delay constrained multicast routing algorithm which is capable of constructing a delay constrained multicast tree wh...
111
click to vote
ICPP
2009
IEEE
14 years 11 months ago
2009
IEEE
In this paper we present a multi-grained parallel algorithm for computing betweenness centrality, which is extensively used in large-scale network analysis. Our method is based on ...
COMSWARE
2007
IEEE
15 years 7 months ago
2007
IEEE
—Clustering techniques create hierarchal network structures, called clusters, on an otherwise flat network. Neighboring devices elect one appropriate device as clusterhead. Due t...