z-logo
open-access-imgOpen Access
Fast and Memory Optimal Low-Rank Matrix Approximation
Author(s) -
Se-Young Yun,
Marc Lelarge,
Alexandre Proutière
Publication year - 2015
Publication title -
hal (le centre pour la communication scientifique directe)
Language(s) - English
Resource type - Conference proceedings
Subject(s) - rank (graph theory) , dimension (graph theory) , combinatorics , asymptotically optimal algorithm , low rank approximation , matrix (chemical analysis) , mathematics , singular value , binary logarithm , order (exchange) , constant (computer programming) , space (punctuation) , approximation algorithm , discrete mathematics , algorithm , computer science , physics , mathematical analysis , eigenvalues and eigenvectors , materials science , finance , hankel matrix , quantum mechanics , economics , programming language , operating system , composite material

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here