메뉴 건너뛰기




Volumn , Issue , 2009, Pages 673-680

QUIC-SVD: Fast SVD using cosine trees

Author keywords

[No Author keywords available]

Indexed keywords

FORESTRY; LEARNING SYSTEMS; TREES (MATHEMATICS);

EID: 84858783218     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (43)

References (9)
  • 4
    • 33751075906 scopus 로고    scopus 로고
    • Fast Monte Carlo algorithms for matrices II: Computing a low-rank approximation to a matrix
    • DOI 10.1137/S0097539704442696
    • P. Drineas, R. Kannan, and M. W. Mahoney. Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix. SIAM Journal on Computing, 36(1):158-183, 2006. (Pubitemid 46374022)
    • (2006) SIAM Journal on Computing , vol.36 , Issue.1 , pp. 158-183
    • Drineas, P.1    Kannan, R.2    Mahoney, M.W.3
  • 5
    • 35248881205 scopus 로고    scopus 로고
    • An experimental evaluation of a Monte-Carlo algorithm for singular value decomposition
    • P. Drineas, E. Drinea, and P. S. Huggins. An Experimental Evaluation of a Monte-Carlo Algorithm for Singular Value Decomposition. Lectures Notes in Computer Science, 2563:279-296, 2003.
    • (2003) Lectures Notes in Computer Science , vol.2563 , pp. 279-296
    • Drineas, P.1    Drinea, E.2    Huggins, P.S.3
  • 6
    • 35348901208 scopus 로고    scopus 로고
    • Improved approximation algorithms for large matrices via random projections
    • DOI 10.1109/FOCS.2006.37, 4031351, 47th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2006
    • T. Sarlos. Improved Approximation Algorithms for Large Matrices via Random Projections. In 47th IEEE Symposium on Foundations of Computer Science (FOCS), pages 143-152, 2006. (Pubitemid 351175504)
    • (2006) Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS , pp. 143-152
    • Sarlos, T.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.