65 search results - page 4 / 13 » Uniform Derandomization from Pathetic Lower Bounds |
ECCC
2011
13 years 2 months ago
2011
A fundamental fact in the analysis of randomized algorithm is that when n balls are hashed into n bins independently and uniformly at random, with high probability each bin contai...
SODA
2010
ACM
14 years 4 months ago
2010
ACM
We settle the 1-pass space complexity of (1 ? )approximating the Lp norm, for real p with 1 p 2, of a length-n vector updated in a length-m stream with updates to its coordinate...
ALT
2002
Springer
14 years 4 months ago
2002
Springer
Abstract. We consider a problem that is related to the “Universal Encoding Problem” from information theory. The basic goal is to find rules that map “partial information”...
ALGOSENSORS
2009
Springer
14 years 2 months ago
2009
Springer
In this paper we study the connectivity problem for wireless networks under the Signal to Interference plus Noise Ratio (SINR) model. Given a set of radio transmitters distributed ...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
In their paper on the "chasm at depth four", Agrawal and Vinay have shown that polynomials in m variables of degree O(m) which admit arithmetic circuits of size 2o(m) al...