170 search results - page 28 / 34 » k-Wise Independent Random Graphs |
83
Voted
PODC
2009
ACM
15 years 11 months ago
2009
ACM
We present a randomized coloring algorithm for the unstructured radio network model, a model comprising autonomous nodes, asynchronous wake-up, no collision detection and an unkno...
100
click to vote
WDAG
2009
Springer
15 years 5 months ago
2009
Springer
Abstract. We adapt the compact routing scheme by Thorup and Zwick to optimize it for power-law graphs. We analyze our adapted routing scheme based on the theory of unweighted rando...
101
click to vote
MSWIM
2004
ACM
15 years 4 months ago
2004
ACM
This study addresses the problem of k-connectivity of a wireless multihop network consisting of randomly placed nodes with a common transmission range, by utilizing empirical regr...
CORR
2010
Springer
14 years 11 months ago
2010
Springer
The causal Markov condition (CMC) is a postulate that links observations to causality. It describes the conditional independences among the observations that are entailed by a cau...
110
click to vote
ACSAC
2010
IEEE
14 years 2 months ago
2010
IEEE
In this work we show that once a single peer-to-peer (P2P) bot is detected in a network, it may be possible to efficiently identify other members of the same botnet in the same ne...