Sciweavers

1434 search results - page 88 / 287
» Distributed Computing with Imperfect Randomness
Sort
View
COMCOM
2008
91views more  COMCOM 2008»
13 years 7 months ago
A WEP post-processing algorithm for a Robust 802.11 WLAN implementation
Wired Equivalent Privacy (WEP) protocol used within the IEEE 802.11 standard has "major security flaws" thus wireless local area networks (WLANs) using the protocol are ...
Taskin Koçak, Mohit Jagetia
EUROCRYPT
1999
Springer
14 years 4 hour ago
Distributed Pseudo-random Functions and KDCs
Abstract. This work describes schemes for distributing between n servers the evaluation of a function f which is an approximation to a random function, such that only authorized su...
Moni Naor, Benny Pinkas, Omer Reingold
SIGGRAPH
1991
ACM
13 years 11 months ago
Spectrally optimal sampling for distribution ray tracing
Nonuniform sampling of images is a useful technique in computer graphics, because a properly designed pattern of samples can make aliasing take the form of high-frequency random n...
Don P. Mitchell
HCW
1998
IEEE
13 years 12 months ago
Dynamic, Competitive Scheduling of Multiple DAGs in a Distributed Heterogeneous Environment
With the advent of large scale heterogeneous environments, there is a need for matching and scheduling algorithms which can allow multiple DAG-structured applications to share the...
Michael A. Iverson, Füsun Özgüner
CORR
2008
Springer
88views Education» more  CORR 2008»
13 years 7 months ago
Lower bounds for distributed markov chain problems
We study the worst-case communication complexity of distributed algorithms computing a path problem based on stationary distributions of random walks in a network G with the caveat...
Rahul Sami, Andy Twigg