搜索结果: 1-1 共查到“管理学 Few Entries”相关记录1条 . 查询时间(0.066 秒)
Let M be an nα × n matrix of rank r n, and assume that a uniformly random subset E of
its entries is observed. We describe an efficient algorithm that reconstructs M from |E| = O(r n)observed entries...