ACM Symposium on Theory of Computing, STOC 2015


Article Details
Title: Tight Bounds for Learning a Mixture of Two Gaussians
Article URLs:
Alternative Article URLs:
Authors: Moritz Hardt
  • IBM Research Almaden
Eric Price
  • University of Texas at Austin
Sharing: Unknown
Verification: Authors have not verified information
Artifact Evaluation Badge: none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers:
DBLP Key: conf/stoc/HardtP15
Author Comments:

Discuss this paper and its artifacts below