ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1210.1461
  4. Cited By
A Scalable CUR Matrix Decomposition Algorithm: Lower Time Complexity and
  Tighter Bound

A Scalable CUR Matrix Decomposition Algorithm: Lower Time Complexity and Tighter Bound

4 October 2012
Shusen Wang
Zhihua Zhang
Jian Li
ArXivPDFHTML

Papers citing "A Scalable CUR Matrix Decomposition Algorithm: Lower Time Complexity and Tighter Bound"

3 / 3 papers shown
Title
CURing Large Models: Compression via CUR Decomposition
CURing Large Models: Compression via CUR Decomposition
Sanghyeon Park
Soo-Mook Moon
38
0
0
08 Jan 2025
An Explicit Sampling Dependent Spectral Error Bound for Column Subset
  Selection
An Explicit Sampling Dependent Spectral Error Bound for Column Subset Selection
Tianbao Yang
Lijun Zhang
R. L. Jin
Shenghuo Zhu
23
21
0
04 May 2015
CUR Algorithm for Partially Observed Matrices
CUR Algorithm for Partially Observed Matrices
Miao Xu
R. L. Jin
Zhi-Hua Zhou
40
34
0
04 Nov 2014
1