An Improved Approximation Algorithm for the Column Subset Selection Problem
- Jan 2009:
ACM-SIAM Symposium on Discrete Algorithms,
New York, NY.
- Sep 2008:
Institute of Pure and Applied Mathematics (IPAM),
UCLA, Los Angeles, CA. (poster).
- Jun 2008:
Workshop on Algorithms for Modern Massive Datasets,
Stanford University, CA (poster).
- May 2008:
SIAM Conference on Optimization,
Boston, MA (poster).
- Feb 2008:
Theory Seminar, Computer Science
Department, Rensselaer Polytechnic Institute, Troy, NY.
- Apr 2007:
4-th Montréal Scientific Computing Days, Centre de Researches Mathématiques,
Université de Montréal, Montreal, Canada.
Clustered Subset Selection and its Applications on IT Service
Metrics
-
Oct 2008: ACM Conference on Information and Knowledge
Management, Nappa Valley, CA.
- Nov 2008:
Institute of Pure and Applied Mathematics (IPAM),
UCLA, Los Angeles, CA.
-
Aug 2008: IBM T.J. Watson Research Lab, Hawthorne, NY.
Effective initializations for Nonnegative Matrix Factorization algorithms
- May 2008:
SIAM
Conference on Optimization, Boston, MA, USA.
PALSIR: A new approach to Nonnegative Tensor Factorization
- Jun 2006:
Workshop on Algorithms for Modern Massive Datasets,
Stanford University and Yahoo! Research, Stanford, CA.