Loading jsMath...
Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > DISTRIBUTION:
Reports tagged with distribution:
TR11-171 | 15th December 2011
Piotr Indyk, Reut Levi, Ronitt Rubinfeld

Approximating and Testing k-Histogram Distributions in Sub-linear time

Revisions: 1

A discrete distribution p, over [n], is a k-histogram if its probability distribution function can be
represented as a piece-wise constant function with k pieces. Such a function
is
represented by a list of k intervals and k corresponding values. We consider
the following problem: given a collection of samples ... more >>>




ISSN 1433-8092 | Imprint