Sciweavers

253 search results - page 23 / 51
» Random Walks with Look-Ahead in Scale-Free Random Graphs
Sort
View
CORR
2004
Springer
104views Education» more  CORR 2004»
14 years 11 months ago
Ramanujan Graphs and the Random Reducibility of Discrete Log on Isogenous Elliptic Curves
Cryptographic applications using an elliptic curve over a finite field filter curves for suitability using their order as the primary criterion: e.g. checking that their order has...
David Jao, Stephen D. Miller, Ramarathnam Venkates...
VTC
2006
IEEE
121views Communications» more  VTC 2006»
15 years 5 months ago
Location-Dependent Parameterization of a Random Direction Mobility Model
— Mobility models are widely used in simulation-based performance analyses of mobile networks. However, there is a trade-off between simplicity and realistic movement patterns. S...
Bernd Gloss, Michael Scharf, Daniel Neubauer
CCR
2004
89views more  CCR 2004»
14 years 11 months ago
Should we build Gnutella on a structured overlay?
There has been much interest in both unstructured and structured overlays recently. Unstructured overlays, like Gnutella, build a random graph and use flooding or random walks on ...
Miguel Castro, Manuel Costa, Antony I. T. Rowstron
INFOCOM
2010
IEEE
14 years 12 months ago
Walking in Facebook: A Case Study of Unbiased Sampling of OSNs
With more than 250 million active users, Facebook (FB) is currently one of the most important online social networks. Our goal in this paper is to obtain a representative (unbiased...
Minas Gjoka, Maciej Kurant, Carter T. Butts, Athin...
DIALM
2008
ACM
140views Algorithms» more  DIALM 2008»
15 years 1 months ago
Latency of opportunistic forwarding in finite regular wireless networks
In opportunistic forwarding, a node randomly relays packets to one of its neighbors based on local information, without the knowledge of global topology. Each intermediate node co...
Prithwish Basu, Chi-Kin Chau