Login / Signup
Deterministic Polynomial Time Algorithms for Matrix Completion Problems.
Gábor Ivanyos
Marek Karpinski
Nitin Saxena
Published in:
Electron. Colloquium Comput. Complex. (2009)
Keyphrases
</>
matrix completion
optimization problems
computational complexity
worst case
theoretical guarantees
feature space
evolutionary algorithm
learning algorithm
small number
graph theory
incomplete data
alternating direction method of multipliers