Approximating and testing k-histogram distributions in sub-linear time
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...
Main Authors: | Indyk, Piotr (Contributor), Levi, Reut (Author), Rubinfeld, Ronitt (Contributor) |
---|---|
Other Authors: | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory (Contributor), Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor) |
Format: | Article |
Language: | English |
Published: |
Association for Computing Machinery (ACM),
2014-05-15T18:13:10Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
Testing Similar Means
by: Levi, Reut, et al.
Published: (2020) -
Testing non-uniform k-wise independent distributions over product spaces (extended abstract)
by: Rubinfeld, Ronitt, et al.
Published: (2012) -
Approximate congruence in nearly linear time
by: Indyk, Piotr, et al.
Published: (2014) -
Local Computation Algorithms for Graphs of Non-constant Degrees
by: Levi, Reut, et al.
Published: (2021) -
Local Algorithms for Sparse Spanning Graphs
by: Levi, Reut, et al.
Published: (2016)