Deterministic algorithms for matrix completion

ABSTRACT The goal of the matrix completion problem is to retrieve an unknown real matrix from a small subset of its entries. This problem comes up in many application areas, and has received a great deal of attention in the context of the Netflix challenge. This setup usually represents our partial...

Celý popis

Podrobná bibliografia

Vydané v:	Random structures & algorithms Ročník 45; číslo 2; s. 306 - 317
Hlavní autori:	Heiman, Eyal, Schechtman, Gideon, Shraibman, Adi
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Hoboken Blackwell Publishing Ltd 01.09.2014 Wiley Subscription Services, Inc
Predmet:	Algorithms Complexity deterministic guarantees Errors expander graphs factorization norms graph sparsifiers matrix completion Norms Sheds
ISSN:	1042-9832, 1098-2418
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!