The optimal sample complexity of matrix completion with hierarchical similarity graphs
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Elmahdy, Adel | ko |
| dc.contributor.author | Suh, Changho | ko |
| dc.contributor.author | Ahn, Junhyung | ko |
| dc.contributor.author | Mohajer, Soheil | ko |
| dc.date.accessioned | 2022-11-25T02:01:22Z | - |
| dc.date.available | 2022-11-25T02:01:22Z | - |
| dc.date.created | 2022-11-24 | - |
| dc.date.issued | 2022-06-30 | - |
| dc.identifier.citation | IEEE International Symposium on Information Theory, ISIT 2022 | - |
| dc.identifier.uri | http://hdl.handle.net/10203/300950 | - |
| dc.language | English | - |
| dc.publisher | IEEE | - |
| dc.title | The optimal sample complexity of matrix completion with hierarchical similarity graphs | - |
| dc.type | Conference | - |
| dc.type.rims | CONF | - |
| dc.citation.publicationname | IEEE International Symposium on Information Theory, ISIT 2022 | - |
| dc.identifier.conferencecountry | FI | - |
| dc.identifier.conferencelocation | Aalto University | - |
| dc.contributor.localauthor | Suh, Changho | - |
| dc.contributor.nonIdAuthor | Elmahdy, Adel | - |
| dc.contributor.nonIdAuthor | Ahn, Junhyung | - |
| dc.contributor.nonIdAuthor | Mohajer, Soheil | - |
- Appears in Collection
- EE-Conference Papers(학술회의논문)
- Files in This Item
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.