268 search results - page 33 / 54 » Finding the k Shortest Paths |
TIP
1998
13 years 7 months ago
1998
—In this paper, we present fast and efficient methods for the lossy encoding of object boundaries that are given as eight-connect chain codes. We approximate the boundary by a p...
ICDCS
1999
IEEE
13 years 12 months ago
1999
IEEE
To provide real-time service or engineer constrained-based paths, networks require the underlying routing algorithm to be able to find low-cost paths that satisfy given Quality-of...
IJISEC
2008
13 years 7 months ago
2008
The Ate pairing has been suggested since it can be computed efficiently on ordinary elliptic curves with small values of the traces of Frobenius t. However, not all pairing-friendl...
MOBICOM
2003
ACM
14 years 26 days 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...
SDM
2012
SIAM
11 years 10 months ago
2012
SIAM
Network-analysis literature is rich in node-centrality measures that quantify the centrality of a node as a function of the (shortest) paths of the network that go through it. Exi...