Efficiently learning mixtures of two Gaussians

Full Text: PdfPdf Buy this ArticleBuy this Article
Authors: Adam Tauman Kalai Microsoft Research New England, Cambridge, MA, USA
Ankur Moitra Massachusetts Institute of Technology, Cambridge, MA, USA
Gregory Valiant University of California, Berkeley, Berkeley, CA, USA
Published in:
Cover Image
 
· Proceeding
STOC '10 Proceedings of the 42nd ACM symposium on Theory of computing
Pages 553-562
ACM New York, NY, USA ©2010
table of contents ISBN: 978-1-4503-0050-6 doi>10.1145/1806689.1806765
Efficiently learning mixtures of two Gaussians Published by ACM 2010 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 4
· Downloads (12 Months): 39
· Downloads (cumulative): 151
· Citation Count: 4


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder