STOC
1997
ACM
13 years 9 months ago
1997
ACM
STOC
1997
ACM
13 years 9 months ago
1997
ACM
STOC
1997
ACM
13 years 10 months ago
1997
ACM
This paper contains several results regarding the communication complexity model and the 2-prover games model, which are based on interaction between the two models:
STOC
1997
ACM
13 years 10 months ago
1997
ACM
STOC
1997
ACM
13 years 10 months ago
1997
ACM
We present randomized constructions of linear-time encodable and decodable codes that can transmit over lossy channels at rates extremely close to capacity. The encoding and decod...
STOC
1997
ACM
13 years 10 months ago
1997
ACM
STOC
1997
ACM
13 years 10 months ago
1997
ACM
STOC
1997
ACM
13 years 10 months ago
1997
ACM
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...
STOC
1997
ACM
13 years 10 months ago
1997
ACM
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...
STOC
1997
ACM
13 years 10 months ago
1997
ACM
Abstract. We study online learning algorithms that predict by combining the predictions of several subordinate prediction algorithms, sometimes called “experts.” These simple a...