Faster streaming algorithms for low-rank matrix approximations
Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2014. === Cataloged from PDF version of thesis. === Includes bibliographical references (pages 53-55). === Low-rank matrix approximations are used in a significant number of application...
Main Author: | Galvin, Timothy Matthew |
---|---|
Other Authors: | Christopher Yu and Piotr Indyk. |
Format: | Others |
Language: | English |
Published: |
Massachusetts Institute of Technology
2014
|
Subjects: | |
Online Access: | http://hdl.handle.net/1721.1/91810 |
Similar Items
-
Sparse approximations, iterative methods, and faster algorithms for matrices and graphs
by: Cohen, Michael Benjamin
Published: (2018) -
Faster algorithms for matrix scaling and balancing via convex optimization
by: Tsipras, Dimitrios
Published: (2017) -
Approximation algorithms for low-distortion embeddings into low-dimensional spaces
by: Sidiropoulos, Anastasios
Published: (2006) -
Smaller steps for faster algorithms : a new approach to solving linear systems
by: Sidford, Aaron Daniel
Published: (2014) -
Efficient and private distance approximation in the communication and streaming models
by: Woodruff, David Paul, 1980-
Published: (2008)