Fast and memory optimal low-rank matrix approximation
In this paper, we revisit the problem of constructing a near-optimal rank k approximation of a matrix M ∈ [0,1]
- Issue Date
- 2015-12-09
- Language
- English
- Citation
Neural Information Processing Systems (NIPS) 2015, pp.3177 - 3185
- Appears in Collection
- IE-Conference Papers(학술회의논문)
- Files in This Item
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.