References
- ACHLIOPTAS. D AND McSHERRY. F, Fast computation of low rank matrix approximations, J.ACM, to appear.
- Agrawal. R, Gerhrke. J, Gunopulos. D, and Raghavan. P, Automaticsubspace clustering of high dimensional data for data mining applications, Proc. ACMSIGMOD Conf. on Management of Data, 1998, 94-105.
- Barbara. D, Faloutsos. Hellerstein. C, Ioannidis. Y, Jagadish. H. V., Johnson. T, R. Ng,
- POOSALA.V, ROSS. K, AND Sevcik. K. C, The New Jersey data reduction report, Bulletin of the IEEE Computer Society Technical Committee on Data Engineering, 1997.
- Drineas. P, Kannan. R, and Mahoney. M. W, Fast Monte Carlo algorithms for matrices I: Approximating matrix multiplication, SIAM J. Comput., 36 (2006), pp. 132-157.
- DRINEAS. P, Kannan. R, AND MAHONEY. M. W, Fast Monte Carlo algorithms for matricesll: Computing a low-rank approximation to a matrix, SIAM J. Comput., 36 (2006), pp.158-183.
- DRINEAS. P AND Kannan. R, Pass efficient algorithms for approximating large matrices, in Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms, 2003, pp. 223-232.
- Feigenbaum. J, Kannan. S, Strauss. M, and Viswanathan. M, An approximate L1 -dfference algorithm for massive data sets, in Proceedings of the 40th Annual IEEE Symposium on the Foundations of Computer Science, 1999, pp. 501-511.
- Golub. G. H and Van Loan. C. F, Matrix Computations, Johns Hopkins University Press, London, 1989.
- Henzinger. M. R, RAGHAVAN. P, AND Rajagopalan. S, Computing on Data Streams, Tech. Report 1998011, Digital Systems Research Center, Palo Alto, CA, 1998.
- MUNRO. J. I AND PATERSON. M. S, Selection and sorting with limited storage, in Proceedings of the 19th Annual IEEE Symposium on Foundations of Computer Science, 1978, pp. 253-258.