Sciweavers

2515 search results - page 499 / 503
» Interval Availability Distribution Computation
Sort
View
SODA
2008
ACM
104views Algorithms» more  SODA 2008»
13 years 8 months ago
Ranged hash functions and the price of churn
Ranged hash functions generalize hash tables to the setting where hash buckets may come and go over time, a typical case in distributed settings where hash buckets may correspond ...
James Aspnes, Muli Safra, Yitong Yin
UAI
2008
13 years 8 months ago
Dyna-Style Planning with Linear Function Approximation and Prioritized Sweeping
We consider the problem of efficiently learning optimal control policies and value functions over large state spaces in an online setting in which estimates must be available afte...
Richard S. Sutton, Csaba Szepesvári, Alborz...
OSDI
1994
ACM
13 years 8 months ago
Performance Issues in Parallelized Network Protocols
Parallel processing has been proposed as a means of improving network protocol throughput. Several different strategies have been taken towards parallelizing protocols. A relative...
Erich M. Nahum, David J. Yates, James F. Kurose, D...
MOBICOM
2010
ACM
13 years 7 months ago
The spaces between us: setting and maintaining boundaries in wireless spectrum access
Guardbands are designed to insulate transmissions on adjacent frequencies from mutual interference. As more devices in a given area are packed into orthogonal wireless channels, c...
Lei Yang, Ben Y. Zhao, Haitao Zheng
BMCBI
2010
110views more  BMCBI 2010»
13 years 6 months ago
On the use of resampling tests for evaluating statistical significance of binding-site co-occurrence
Background: In eukaryotes, most DNA-binding proteins exert their action as members of large effector complexes. The presence of these complexes are revealed in high-throughput gen...
David S. Huen, Steven Russell