390 search results - page 23 / 78 » Computing shortest paths for any number of hops |
122
click to vote
AINA
2008
IEEE
15 years 3 months ago
2008
IEEE
A mobile ad hoc network (MANET) is a network without any predefined infrastructure in which every node not only enjoys the services from the network, but serves the network as a r...
152
Voted
IEEEMSP
2002
IEEE
15 years 6 months ago
2002
IEEE
—This paper presents an operational rate-distortion (ORD) optimal approach for skeleton-based boundary encoding. The boundary information is first decomposed into skeleton and di...
129
click to vote
WAW
2007
Springer
15 years 8 months ago
2007
Springer
Betweenness is a centrality measure based on shortest paths, widely used in complex network analysis. It is computationally-expensive to exactly determine betweenness; currently th...
116
click to vote
APNOMS
2009
Springer
15 years 8 months ago
2009
Springer
Applications in wireless sensor networks (WSNs) experience the routing hole problem. That is, the current node cannot forward to the destination, although it is the closest node, b...
109
Voted
ICPP
2009
IEEE
14 years 11 months ago
2009
IEEE
In this paper we work on the parallelization of the inherently serial Dijkstra's algorithm on modern multicore platforms. Dijkstra's algorithm is a greedy algorithm that ...