Sciweavers

STOC
1997
ACM
126views Algorithms» more  STOC 1997»
14 years 3 months ago
Page Replacement with Multi-Size Pages and Applications to Web Caching
We consider the paging problem where the pages have varying size. This problem has applications to page replacement policies for caches containing World Wide Web documents. We con...
Sandy Irani
STOC
1997
ACM
111views Algorithms» more  STOC 1997»
14 years 3 months ago
The Swendsen-Wang Process Does Not Always Mix Rapidly
The Swendsen-Wang process provides one possible dynamics for the Qstate Potts model in statistical physics. Computer simulations of this process are widely used to estimate the ex...
Vivek Gore, Mark Jerrum
STOC
1997
ACM
97views Algorithms» more  STOC 1997»
14 years 3 months ago
Using and Combining Predictors That Specialize
Abstract. We study online learning algorithms that predict by combining the predictions of several subordinate prediction algorithms, sometimes called “experts.” These simple a...
Yoav Freund, Robert E. Schapire, Yoram Singer, Man...
STOC
1997
ACM
125views Algorithms» more  STOC 1997»
14 years 3 months ago
An Interruptible Algorithm for Perfect Sampling via Markov Chains
For a large class of examples arising in statistical physics known as attractive spin systems (e.g., the Ising model), one seeks to sample from a probability distribution π on an...
James Allen Fill
STOC
1997
ACM
91views Algorithms» more  STOC 1997»
14 years 3 months ago
Approximating Hyper-Rectangles: Learning and Pseudo-Random Sets
Peter Auer, Philip M. Long, Aravind Srinivasan
STOC
1997
ACM
91views Algorithms» more  STOC 1997»
14 years 3 months ago
Lower Bounds for Distributed Coin-Flipping and Randomized Consensus
We examine a class of collective coin- ipping games that arises from randomized distributed algorithms with halting failures. In these games, a sequence of local coin ips is gener...
James Aspnes
STOC
1997
ACM
122views Algorithms» more  STOC 1997»
14 years 3 months ago
Fault-Tolerant Quantum Computation With Constant Error
Shor has showed how to perform fault tolerant quantum computation when the probability for an error in a qubit or a gate, η, decays with the size of the computation polylogarithmi...
Dorit Aharonov, Michael Ben-Or
STOC
1997
ACM
82views Algorithms» more  STOC 1997»
14 years 3 months ago
Reducing the Complexity of Reductions
Manindra Agrawal, Eric Allender, Russell Impagliaz...