1015 search results - page 78 / 203 » An efficient algorithm for AS path inferring |
LCN
2007
IEEE
14 years 2 months ago
2007
IEEE
- Multiple distribution trees and multiple description (MD) coding are highly robust since they provide redundancy both in network paths and data. However, MD coded streaming inclu...
ESA
2008
Springer
13 years 10 months ago
2008
Springer
In recent years, many speed-up techniques for Dijkstra's algorithm have been developed that make the computation of shortest paths in static road networks a matter of microse...
UAI
2008
13 years 9 months ago
2008
Graphical models are usually learned without regard to the cost of doing inference with them. As a result, even if a good model is learned, it may perform poorly at prediction, be...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
—A recent paper [1] proposed a provably optimal polynomial time method for performing near-isometric point pattern matching by means of exact probabilistic inference in a chordal...
SIGMETRICS
2002
ACM
13 years 7 months ago
2002
ACM
In this paper we consider the problem of inferring link-level loss rates from end-to-end multicast measurements taken from a collection of trees. We give conditions under which lo...