An Improved Approximation Algorithm for the Column Subset Selection Problem
-
ACM-SIAM Symposium on Discrete Algorithms (SODA),
New York, NY, January 2009 [slides]
-
Workshop I: Multiscale Representation, Analysis
and Modeling of Internet Data and Measurement, IPAM,
UCLA, CA, Sept 2008 [poster]
-
Workshop on Algorithms for Modern Massive Datasets
(MMDS), Stanford University, CA, June 2008 [poster]
-
SIAM Conference on Optimization,
Boston, MA, May 2008 [poster]
-
Theory Seminar, Computer Science
Department, Rensselaer Polytechnic Institute, Troy, NY, February 2008 [slides]
-
4-th Montréal Scientific Computing Days, Centre de Researches Mathématiques,
Université de Montréal, Montreal, Canada, April 2007 [slides]
Clustered Subset Selection and its Applications on IT Service
Metrics
-
ACM Conference on Information and Knowledge Management (CIKM), Nappa
Valley, CA, October 2008 [slides]
-
MRA Talk Series, IPAM,
UCLA, CA, November 2008 [abstract,
slides]
Automatic Summary and Insight on IT Service Metric Monitoring
IBM T.J. Watson Research Lab, Hawthorne, NY, August 2008 [slides]
Effective initializations for Nonnegative Matrix Factorization algorithms
-
SIAM
Conference on Optimization, Boston, MA, USA, May 2008 [slides]
-
GAMM-SIAM Conference on Applied Linear
Algebra, Düsseldorf, Germany, July 2006 [slides]
PALSIR: A new approach to Nonnegative Tensor Factorization
Workshop on Algorithms for Modern Massive Datasets
(MMDS), Stanford University and Yahoo! Research,
Stanford, CA, USA, June 2006 [poster]