Sciweavers

1778 search results - page 10 / 356
» On the Power of the Randomized Iterate
Sort
View
CGF
1999
79views more  CGF 1999»
14 years 9 months ago
Stochastic Iteration for Non-diffuse Global Illumination
This paper presents a single-pass, view-dependent method to solve the rendering equation, using a stochastic iterational scheme where the transport operator is selected randomly i...
László Szirmay-Kalos

Publication
203views
14 years 9 months ago
Multigraph Sampling of Online Social Networks
State-of-the-art techniques for probability sampling of users of online social networks (OSNs) are based on random walks on a single social relation. While powerful, these methods ...
Minas Gjoka, Carter T. Butts, Maciej Kurant, Athin...
JSAC
2006
95views more  JSAC 2006»
14 years 9 months ago
A low-rate code-spread and chip-interleaved time-hopping UWB system
We consider a code-spread and chip-interleaved time-hopping (TH) multiple-access scheme for multiuser ultra-wideband (UWB) communications. In such a system, each user's chip s...
Kai Li, Xiaodong Wang, Guosen Yue, Li Ping
85
Voted
CRYPTO
2000
Springer
120views Cryptology» more  CRYPTO 2000»
15 years 1 months ago
L-collision Attacks against Randomized MACs
In order to avoid birthday attacks on message authentication schemes, it has been suggested that one add randomness to the scheme. One must be careful about how randomness is added...
Michael Semanko
83
Voted
INFOCOM
2010
IEEE
14 years 8 months ago
Joint Random Access and Power Selection for Maximal Throughput in Wireless Networks
—In wireless networks, how to select transmit power that maximizes throughput is a challenging problem. On one hand, transmissions at a high power level could increase interferen...
Yan Gao, Zheng Zeng, P. R. Kumar