most citedOn the Robustness of Cross-Concentrated Sampling for Matrix Completion

3 citations · 3 across the 3 of their papers we have counts for

collaborators
Showing math.NAShow all

1 paper · 1 filter

math.NA2025

Scalable Binary CUR Low-Rank Approximation Algorithm

Bowen Su

This paper proposes a scalable binary CUR low-rank approximation algorithm that leverages parallel selection of representative rows and columns within a deterministic framework. By…