메뉴 건너뛰기




Volumn 4110 LNCS, Issue , 2006, Pages 272-279

A fast random sampling algorithm for sparsifying matrices

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; MATRIX ALGEBRA; PROBLEM SOLVING; VECTORS;

EID: 33750091599     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11830924_26     Document Type: Conference Paper
Times cited : (65)

References (11)
  • 1
    • 33748601484 scopus 로고    scopus 로고
    • Fast algorithms for approximate semidefinite programming using the multiplicative weights update method
    • [AHK05]
    • [AHK05] Sanjeev Arora, Elad Hazan, and Satyen Kale. Fast algorithms for approximate semidefinite programming using the multiplicative weights update method. In 46th FOCS, pages 339-348, 2005.
    • (2005) 46th FOCS , pp. 339-348
    • Arora, S.1    Hazan, E.2    Kale, S.3
  • 2
    • 0034830284 scopus 로고    scopus 로고
    • Fast computation of low rank matrix approximations
    • [AM01]
    • [AM01] Dimitris Achlioptas and Frank McSherry. Fast computation of low rank matrix approximations. In 32nd STOC, pages 611-618, 2001.
    • (2001) 32nd STOC , pp. 611-618
    • Achlioptas, D.1    McSherry, F.2
  • 3
    • 3142750484 scopus 로고    scopus 로고
    • Clustering large graphs via the singular value decomposition
    • +04]
    • +04] Petros Drineas, Alan M. Frieze, Ravi Kannan, Santosh Vempala, and V. Vinay. Clustering large graphs via the singular value decomposition. Machine Learning, 56(1-3):9-33, 2004.
    • (2004) Machine Learning , vol.56 , Issue.1-3 , pp. 9-33
    • Drineas, P.1    Frieze, A.M.2    Kannan, R.3    Vempala, S.4    Vinay, V.5
  • 4
    • 0038416092 scopus 로고    scopus 로고
    • Pass efficient algorithms for approximating large matrices
    • [DK03]
    • [DK03] Petros Drineas and Ravi Kannan. Pass efficient algorithms for approximating large matrices. In SODA, pages 223-232, 2003.
    • (2003) SODA , pp. 223-232
    • Drineas, P.1    Kannan, R.2
  • 6
    • 51849141693 scopus 로고    scopus 로고
    • Adaptive sampling and fast low-rank matrix approximation
    • [DV06]
    • [DV06] Amit Deshpande and Santosh Vempala. Adaptive sampling and fast low-rank matrix approximation. In RANDOM, 2006.
    • (2006) RANDOM
    • Deshpande, A.1    Vempala, S.2
  • 7
    • 20444476106 scopus 로고    scopus 로고
    • Fast monte-carlo algorithms for finding low-rank approximations
    • [FKV04]
    • [FKV04] Alan M. Frieze, Ravi Kannan, and Santosh Vempala. Fast monte-carlo algorithms for finding low-rank approximations. J. ACM, 51 (6):1025-1041, 2004.
    • (2004) J. ACM , vol.51 , Issue.6 , pp. 1025-1041
    • Frieze, A.M.1    Kannan, R.2    Vempala, S.3
  • 8
    • 26944482759 scopus 로고    scopus 로고
    • Spectral techniques applied to sparse random graphs
    • [FO05], September
    • [FO05] U. Feige and E. Ofek. Spectral techniques applied to sparse random graphs. Random Structures and Algorithms, 27(2):251-275, September 2005.
    • (2005) Random Structures and Algorithms , vol.27 , Issue.2 , pp. 251-275
    • Feige, U.1    Ofek, E.2
  • 9
    • 84947403595 scopus 로고
    • Probability inequalities for sums of bounded random variables
    • [Hoe63]
    • [Hoe63] W. Hoeffding. Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association, 58(301):13-30, 1963.
    • (1963) Journal of the American Statistical Association , vol.58 , Issue.301 , pp. 13-30
    • Hoeffding, W.1


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