1594 search results - page 249 / 319 » An Algorithm to Compute Collusion Paths |
155
click to vote
PODC
2005
ACM
15 years 11 months ago
2005
ACM
One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This paper inves...
178
click to vote
EUROGRAPHICS
2010
Eurographics
16 years 2 months ago
2010
Eurographics
Recent proliferation of camera phones, photo sharing and social network services has significantly changed how we process our photos. Instead of going through the traditional dow...
153
click to vote
STACS
2007
Springer
16 years 8 days ago
2007
Springer
A coloring of a graph is convex if it induces a partition of the vertices into connected subgraphs. Besides being an interesting property from a theoretical point of view, tests f...
175
click to vote
TPDS
2008
15 years 6 months ago
2008
To construct an efficient overlay network, the information of underlay is important. We consider using end-to-end measurement tools such as traceroute to infer the underlay topolog...
159
click to vote
SIGCOMM
1999
ACM
15 years 10 months ago
1999
ACM
The conventional approach to routing in computer networks consists of using a heuristic to compute a single shortest path from a source to a destination. Single-path routing is ve...