549 search results - page 59 / 110 » Computing All the Best Swap Edges Distributively |
SPAA
2003
ACM
15 years 3 months ago
2003
ACM
In a (randomized) oblivious routing scheme the path chosen for a request between a source s and a target t is independent from the current traffic in the network. Hence, such a sc...
IWCMC
2006
ACM
15 years 3 months ago
2006
ACM
Broadcasting in ad hoc networks is required for many routing and other network-layer protocols to request information like routes or locations about destination nodes. Most of the...
BMCBI
2008
14 years 9 months ago
2008
Background: Inference of evolutionary trees using the maximum likelihood principle is NP-hard. Therefore, all practical methods rely on heuristics. The topological transformations...
CCS
2008
ACM
14 years 11 months ago
2008
ACM
In this paper, we model Probabilistic Packet Marking (PPM) schemes for IP traceback as an identification problem of a large number of markers. Each potential marker is associated ...
JACM
2011
14 years 4 months ago
2011
We analyze the convergence of randomized trace estimators. Starting at 1989, several algorithms have been proposed for estimating the trace of a matrix by 1 M M i=1 zT i Azi, where...