Author:
Liberty Edo,Zucker Steven W.
Subject
Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science
Reference15 articles.
1. Database-friendly random projections: Johnson–Lindenstrauss with binary coins;Achlioptas;J. Comput. Syst. Sci.,2003
2. N. Ailon, B. Chazelle, Approximate nearest neighbors and the fast Johnson–Lindenstrauss transform, in: Proceedings of the 38st Annual Symposium on the Theory of Computing (STOC), Seattle, WA, 2006, pp. 557–563
3. Fast dimension reduction using Rademacher series on dual BCH codes;Ailon,2008
4. On the number of multiplications required for matrix multiplication;Brockett;SIAM J. Comput.,1976
5. Matrix multiplication via arithmetic progressions;Coppersmith,1987
Cited by
43 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献