most citedOn Deterministic Sampling Patterns for Robust Low-Rank Matrix Completion

17 citations · 40 across the 7 of their papers we have counts for

collaborators
Showing math.NAShow all

1 paper · 1 filter

math.NA2016★ 3 cited

Deterministic and Probabilistic Conditions for Finite Completability of Low-Tucker-Rank Tensor

Morteza Ashraphijuo, Vaneet Aggarwal, Xiaodong Wang

We investigate the fundamental conditions on the sampling pattern, i.e., locations of the sampled entries, for finite completability of a low-rank tensor given some components of i…