2084 search results - page 141 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
204
click to vote
SIAMCOMP
2011
14 years 12 months ago
2011
Abstract. In the 2nd Annual FOCS (1961), Chao-Kong Chow proved that every Boolean threshold function is uniquely determined by its degree-0 and degree-1 Fourier coefficients. These...
120
Voted
JPDC
2010
15 years 3 months ago
2010
This paper shows that shared coin algorithms can be combined to optimize several complexity measures, even in the presence of a strong adversary. By combining shared coins of Brac...
140
click to vote
COLT
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. We consider the problem of estimating an unknown probability distribution from samples using the principle of maximum entropy (maxent). To alleviate overfitting with a v...
192
click to vote
TCS
2011
14 years 12 months ago
2011
Abstract. We present the first fully dynamic algorithm for computing the characteristic polynomial of a matrix. In the generic symmetric case our algorithm supports rank-one updat...
166
click to vote
STOC
2012
ACM
13 years 7 months ago
2012
ACM
We consider the file maintenance problem (also called the online labeling problem) in which n integer items from the set {1, . . . , r} are to be stored in an array of size m ≥...