How to Summarize the Universe, Conference on Very Large Databases, 2002. ,
DOI : 10.1016/B978-155860869-6/50047-0
An improved data stream summary: the count-min sketch and its applications, Journal of Algorithms, vol.55, issue.1, pp.58-75, 2005. ,
DOI : 10.1016/j.jalgor.2003.12.001
Methods for finding frequent items in data streams, The VLDB Journal, vol.15, issue.5, pp.3-20, 2010. ,
DOI : 10.1007/s00778-009-0172-z
Dynamic multidimensional histograms, Proceedings of the 2002 ACM SIGMOD international conference on Management of data , SIGMOD '02, 2002. ,
DOI : 10.1145/564691.564741
SPADES and mixture models, The Annals of Statistics, vol.38, issue.4, pp.2525-2558, 2010. ,
DOI : 10.1214/09-AOS790
URL : https://hal.archives-ouvertes.fr/hal-00514124
Adaptive Dantzig density estimation, Annales de l'Institut Henri Poincaré (B) Probabilités et Statistiques, pp.43-74, 2011. ,
DOI : 10.1214/09-AIHP351
URL : https://hal.archives-ouvertes.fr/hal-00381984
Compressed learning : Universal sparse dimensionality reduction and learning in the measurement domain, 2009. ,
Compressed least-squares regression, Neural Information Processing Systems Conference, 2009. ,
URL : https://hal.archives-ouvertes.fr/inria-00419210
Compressive neural representation of sparse, highdimensional probabilities, Neural Information Processing Systems Conference, 2012. ,
Online EM for unsupervised models, Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics on, NAACL '09, 2009. ,
DOI : 10.3115/1620754.1620843
The tradeoffs of large scale learning, Neural Information Processing Systems Conference, 2008. ,