Sciweavers

1763 search results - page 84 / 353
» Dependent random choice
Sort
View
ICALP
2009
Springer
14 years 9 months ago
Tight Bounds for the Cover Time of Multiple Random Walks
We study the cover time of multiple random walks. Given a graph G of n vertices, assume that k independent random walks start from the same vertex. The parameter of interest is the...
Robert Elsässer, Thomas Sauerwald
COMCOM
2006
147views more  COMCOM 2006»
13 years 9 months ago
Coverage-adaptive random sensor scheduling for application-aware data gathering in wireless sensor networks
Due to the application-specific nature of wireless sensor networks, application-aware algorithm and protocol design paradigms are highly required in order to optimize the overall ...
Wook Choi, Sajal K. Das
INFOCOM
2007
IEEE
14 years 3 months ago
Queuing Delays in Randomized Load Balanced Networks
—Valiant’s concept of Randomized Load Balancing (RLB), also promoted under the name ‘two-phase routing’, has previously been shown to provide a cost-effective way of implem...
Ravi Prasad, Peter J. Winzer, Sem C. Borst, Marina...
MMNS
2001
151views Multimedia» more  MMNS 2001»
13 years 10 months ago
Analysis of Random Access Protocol under Bursty Traffic
Aloha-type random-access protocols have been employed as access control protocols in wireline and wireless, stationary and mobile, multiple-access communications networks. They are...
Jianbo Gao, Izhak Rubin
CHES
1999
Springer
133views Cryptology» more  CHES 1999»
14 years 1 months ago
Random Number Generators Founded on Signal and Information Theory
The strength of a cryptographic function depends on the amount of entropy in the cryptovariables that are used as keys. Using a large key length with a strong algorithm is false co...
David Paul Maher, Robert J. Rance