501 search results - page 77 / 101 » Communication Lower Bounds Using Dual Polynomials |
LFCS
2007
Springer
14 years 2 months ago
2007
Springer
We present a general algorithm scheme for model checking logics of knowledge, common knowledge and linear time, based on simulations to a class of structures that capture the way t...
ICOIN
2003
Springer
14 years 2 months ago
2003
Springer
Abstract. TFRC (TCP Friendly Rate Control) is a rate-based congestion control protocol for non-TCP flows. TFRC controls the sending rate by using the TCP throughput equation consi...
SPAA
2005
ACM
14 years 2 months ago
2005
ACM
An asynchronous algorithm is described for rapidly constructing an overlay network in a peer-to-peer system where all nodes can in principle communicate with each other directly t...
GLOBECOM
2010
IEEE
13 years 6 months ago
2010
IEEE
1 Shannon's channel capacity specifies the upper bound on the amount of bits per channel use. In this paper, we explicitly demonstrate that twin-component turbo codes suffer f...
FOCS
2009
IEEE
14 years 3 months ago
2009
IEEE
We study solution sets to systems of generalized linear equations of the form ℓi(x1, x2, · · · , xn) ∈ Ai (mod m) where ℓ1, . . . , ℓt are linear forms in n Boolean var...