Sciweavers

648 search results - page 11 / 130
» Lowness for Demuth Randomness
Sort
View
TON
2002
86views more  TON 2002»
14 years 9 months ago
Efficient randomized web-cache replacement schemes using samples from past eviction times
The problem of document replacement in web caches has received much attention in recent research, and it has been shown that the eviction rule "replace the least recently used...
Konstantinos Psounis, Balaji Prabhakar
INFOCOM
2010
IEEE
14 years 8 months ago
Randomized Differential DSSS: Jamming-Resistant Wireless Broadcast Communication
—Jamming resistance is crucial for applications where reliable wireless communication is required. Spread spectrum techniques such as Frequency Hopping Spread Spectrum (FHSS) and...
Yao Liu, Peng Ning, Huaiyu Dai, An Liu
INFOCOM
2006
IEEE
15 years 3 months ago
Designing Low Cost Networks with Short Routes and Low Congestion
— We design network topologies and routing strategies which optimize several measures simultaneously: low cost, small routing diameter , bounded degree and low congestion. This s...
Van Nguyen, Charles U. Martel
ISPA
2004
Springer
15 years 3 months ago
A Scalable Low Discrepancy Point Generator for Parallel Computing
The Monte Carlo (MC) method is a simple but effective way to perform simulations involving complicated or multivariate functions. The QuasiMonte Carlo (QMC) method is similar but...
Kwong-Ip Liu, Fred J. Hickernell
DASFAA
2010
IEEE
193views Database» more  DASFAA 2010»
14 years 7 months ago
A Simple, Yet Effective and Efficient, Sliding Window Sampling Algorithm
Sampling streams of continuous data with limited memory, or reservoir sampling, is a utility algorithm. Standard reservoir sampling maintains a random sample of the entire stream a...
Xuesong Lu, Wee Hyong Tok, Chedy Raïssi, St&e...