Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

9

FOCS
2007
IEEE

favoriteEmaildiscussreport

97views Theoretical Computer Science» more FOCS 2007»

Strong Lower Bounds for Approximating Distribution Support Size and the Distinct Elements Problem

13 years 11 months ago

Strong Lower Bounds for Approximating Distribution Support Size and the Distinct Elements Problem

Download www.cs.technion.ac.il

Sofya Raskhodnikova, Dana Ron, Amir Shpilka, Adam

Real-time Traffic

FOCS 2007 | Theoretical Computer Science |

claim paper

Related Content

» The averagecase complexity of counting distinct elements

» Lower bounds for randomized readwrite stream algorithms

» Lower Bounds and Hardness Amplification for Learning Shallow Monotone Formulas

» Spaceoptimal heavy hitters with strong error bounds

» Estimating the unseen A sublinearsample canonical estimator of distributions

» TimeIndexed Formulations for Machine Scheduling Problems Column Generation

» Sublinear Algorithms for Approximating String Compressibility

» Distributed localization using noisy distance and angle information

» Coresets for polytope distance

Post Info
More Details (n/a)

Added	02 Jun 2010
Updated	02 Jun 2010
Type	Conference
Year	2007
Where	FOCS
Authors	Sofya Raskhodnikova, Dana Ron, Amir Shpilka, Adam Smith

Comments (0)