168 search results - page 10 / 34 » Lower Bounds for Distributed Coin-Flipping and Randomized Co... |
TSP
2008
14 years 11 months ago
2008
Abstract--This correspondence derives lower bounds on the meansquare error (MSE) for the estimation of a covariance matrix , using samples k = 1; . . . ; K, whose covariance matric...
CORR
2006
Springer
14 years 11 months ago
2006
Springer
In this paper, random coding error exponents and cutoff rate are studied for noncoherent Rician fading channels, where neither the receiver nor the transmitter has channel side inf...
RSA
1998
14 years 11 months ago
1998
It is well known that after placing n balls independently and uniformly at random into n bins, the fullest bin holds (logn=log logn) balls with high probability. Recently, Azar et...
192
click to vote
ICDT
2009
ACM
16 years 12 days ago
2009
ACM
We continue the study of approximating the number of distinct elements in a data stream of length n to within a (1? ) factor. It is known that if the stream may consist of arbitra...
PODC
2009
ACM
16 years 7 days ago
2009
ACM
d Abstract] Danny Hendler Department of Computer-Science Ben-Gurion University hendlerd@cs.bgu.ac.il Philipp Woelfel Department of Computer-Science University of Calgary woelfel@cp...