390 search results - page 15 / 78 » Computing shortest paths for any number of hops |
100
click to vote
BMCBI
2007
14 years 11 months ago
2007
Background: In recent years, RNA molecules that are not translated into proteins (ncRNAs) have drawn a great deal of attention, as they were shown to be involved in many cellular ...
ICNP
1997
IEEE
15 years 3 months ago
1997
IEEE
Transmission ofmultimedia streams imposesa minimum-bandwidth requirementon the path being usedto ensureend-to-endQuality-ofService (QoS) guarantees. While any shortest-path algori...
101
click to vote
ICCV
2007
IEEE
15 years 6 months ago
2007
IEEE
The matching of planar shapes can be cast as a problem of finding the shortest path through a graph spanned by the two shapes, where the nodes of the graph encode the local simil...
APPT
2007
Springer
15 years 5 months ago
2007
Springer
We investigate the problem of constructing the maximal number of node disjoint paths between two distinct nodes in Swapped/OTIS networks. A general construction of node disjoint pa...
MST
2002
14 years 11 months ago
2002
We study the average number of delays suffered by packets routed using greedy (work conserving) scheduling policies. We obtain tight bounds on the worst-case average number of del...