13214 search results - page 13 / 2643 » Pseudorandomness for network algorithms |
132
click to vote
SIGCOMM
2012
ACM
13 years 2 months ago
2012
ACM
A fundamental problem in wireless networks is to develop communication protocols that achieve high throughput in the face of noise, interference, and fading, all of which vary wit...
NDSS
2009
IEEE
15 years 6 months ago
2009
IEEE
We describe CSAR, a novel technique for generating cryptographically strong, accountable randomness. Using CSAR, we can generate a pseudo-random sequence and a proof that the elem...
WDAG
2009
Springer
15 years 6 months ago
2009
Springer
Virtual Ring Routing (VRR) schemes were introduced in the context of wireless ad hoc networks and Internet anycast overlays. They build a network-routing layer using ideas from dis...
120
click to vote
FUN
2010
Springer
15 years 4 months ago
2010
Springer
We propose a model for level-ups in Heroes of Might and Magic III, and give an O 1 ε2 ln 1 δ learning algorithm to estimate the probabilities of secondary skills induced by any ...
113
click to vote
IPTPS
2005
Springer
15 years 5 months ago
2005
Springer
In Peer-to-Peer networks based on consistent hashing and ring topology each server is responsible for an interval chosen (pseudo-)randomly on a circle. The topology of the network...