I agree that this site is using cookies. You can find further informations
here
.
X
Login
Merkliste (
0
)
Home
About us
Home About us
Our history
Profile
Press & public relations
Friends
The library in figures
Exhibitions
Projects
Training, internships, careers
Films
Services & Information
Home Services & Information
Lending and interlibrary loans
Returns and renewals
Training and library tours
My Account
Library cards
New to the library?
Download Information
Opening hours
Learning spaces
PC, WLAN, copy, scan and print
Catalogs and collections
Home Catalogs and Collections
Rare books and manuscripts
Digital collections
Subject Areas
Our sites
Home Our sites
Central Library
Law Library (Juridicum)
BB Business and Economics (BB11)
BB Physics and Electrical Engineering
TB Engineering and Social Sciences
TB Economics and Nautical Sciences
TB Music
TB Art & Design
TB Bremerhaven
Contact the library
Home Contact the library
Staff Directory
Open access & publishing
Home Open access & publishing
Reference management: Citavi & RefWorks
Publishing documents
Open Access in Bremen
zur Desktop-Version
Toggle navigation
Merkliste
1 Ergebnisse
1
The Optimal Sample Complexity of Matrix Completion with Hie..:
, In:
2022 IEEE International Symposium on Information Theory (ISIT)
,
Elmahdy, Adel
;
Ahn, Junhyung
;
Mohajer, Soheil
. - p. 2409-2414 , 2022
Link:
https://doi.org/10.1109/ISIT50566.2022.9834449
RT T1
2022 IEEE International Symposium on Information Theory (ISIT)
: T1
The Optimal Sample Complexity of Matrix Completion with Hierarchical Similarity Graphs
UL https://suche.suub.uni-bremen.de/peid=ieee-9834449&Exemplar=1&LAN=DE A1 Elmahdy, Adel A1 Ahn, Junhyung A1 Mohajer, Soheil A1 Suh, Changho YR 2022 SN 2157-8117 K1 Stochastic processes K1 Complexity theory K1 Recommender systems K1 Information theory SP 2409 OP 2414 LK http://dx.doi.org/https://doi.org/10.1109/ISIT50566.2022.9834449 DO https://doi.org/10.1109/ISIT50566.2022.9834449 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)