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. 1302.5337
  4. Cited By
Obtaining error-minimizing estimates and universal entry-wise error
  bounds for low-rank matrix completion

Obtaining error-minimizing estimates and universal entry-wise error bounds for low-rank matrix completion

21 February 2013
Franz J. Király
Louis Theran
ArXivPDFHTML

Papers citing "Obtaining error-minimizing estimates and universal entry-wise error bounds for low-rank matrix completion"

2 / 2 papers shown
Title
The Algebraic Combinatorial Approach for Low-Rank Matrix Completion
The Algebraic Combinatorial Approach for Low-Rank Matrix Completion
Franz J. Király
Louis Theran
Ryota Tomioka
121
111
0
17 Nov 2012
Matrix Completion from a Few Entries
Matrix Completion from a Few Entries
Raghunandan H. Keshavan
Andrea Montanari
Sewoong Oh
323
1,242
0
20 Jan 2009
1