1594 search results - page 49 / 319 » An Algorithm to Compute Collusion Paths |
ICCTA
2007
IEEE
15 years 6 months ago
2007
IEEE
We study the dynamic version of the distributed all-pairs shortest paths problem. Most of the solutions given in the literature for this problem work under the assumption that bef...
110
click to vote
MOBIHOC
2002
ACM
15 years 11 months ago
2002
ACM
Topological changes in mobile ad hoc networks frequently render routing paths unusable. Such recurrent path failures have detrimental effects on the network ability to support QoS...
114
click to vote
CVPR
2011
IEEE
14 years 8 months ago
2011
IEEE
We present a novel algorithm for automatically applying constrainable, L1-optimal camera paths to generate stabilized videos by removing undesired motions. Our goal is to compute ...
100
click to vote
ICPP
2009
IEEE
15 years 6 months ago
2009
IEEE
We present a new parallel algorithm that extends and generalizes the traditional graph analysis metric of betweenness centrality to include additional non-shortest paths according...
108
click to vote
MOBICOM
2003
ACM
15 years 5 months ago
2003
ACM
We develop algorithms for finding minimum energy disjoint paths in an all-wireless network, for both the node and linkdisjoint cases. Our major results include a novel polynomial...