Search Results for author:
Found 1 papers, 0 papers with code
Communication and Memory Efficient Testing of Discrete Distributions
We study distribution testing with communication and memory constraints in the following computational models: (1) The {\em one-pass streaming model} where the goal is to minimize the sample complexity of the protocol subject to a memory constraint, and (2) A {\em distributed model} where the data samples reside at multiple machines and the goal is to minimize the communication cost of the protocol.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
