2084 search results - page 324 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
STOC
2006
ACM
15 years 10 months ago
2006
ACM
Gowers [Gow98, Gow01] introduced, for d 1, the notion of dimension-d uniformity Ud (f) of a function f : G C, where G is a finite abelian group. Roughly speaking, if a function ...
TWC
2011
14 years 4 months ago
2011
—In this paper, the performance of the ALOHA and CSMA MAC protocols are analyzed in spatially distributed wireless networks. The main system objective is correct reception of pac...
COCO
2009
Springer
15 years 4 months ago
2009
Springer
We prove two main results on how arbitrary linear threshold functions f(x) = sign(w · x − θ) over the n-dimensional Boolean hypercube can be approximated by simple threshold f...
114
click to vote
ICDCSW
2002
IEEE
15 years 2 months ago
2002
IEEE
In this paper we focus on the design of high performance peer-to-peer content sharing systems. In particular, our goal is to achieve global load balancing and short user-request r...
101
click to vote
ISCC
2003
IEEE
15 years 3 months ago
2003
IEEE
We present a noiseless source coding problem in a broadcast environment and supply a simple solution to this problem. A transmitter wishes to transmit a binary random vector Ò ½...