Zobrazeno 1 - 10
of 27
pro vyhledávání: '"Parrinello, Emanuele"'
This work studies a well-known shared-cache coded caching scenario where each cache can serve an arbitrary number of users, analyzing the case where there is some knowledge about such number of users (i.e., the topology) during the content placement
Externí odkaz:
http://arxiv.org/abs/2302.10036
Multi-antenna coded caching combines a global caching gain, proportional to the total cache size in the network, with an additional spatial multiplexing gain that stems from multiple transmitting antennas. However, classic centralized coded caching s
Externí odkaz:
http://arxiv.org/abs/2111.07626
Autor:
Salehi, MohammadJavad, Parrinello, Emanuele, Shariatpanahi, Seyed Pooya, Elia, Petros, Tölli, Antti
Multi-antenna coded caching is known to combine a global caching gain that is proportional to the cumulative cache size found across the network, with an additional spatial multiplexing gain that stems from using multiple transmitting antennas. Howev
Externí odkaz:
http://arxiv.org/abs/2009.12231
The work establishes the exact performance limits of stochastic coded caching when users share a bounded number of cache states, and when the association between users and caches, is random. Under the premise that more balanced user-to-cache associat
Externí odkaz:
http://arxiv.org/abs/2005.13847
The work explores the fundamental limits of coded caching in heterogeneous networks where multiple ($N_0$) senders/antennas, serve different users which are associated (linked) to shared caches, where each such cache helps an arbitrary number of user
Externí odkaz:
http://arxiv.org/abs/1811.06247
The work identifies the fundamental limits of coded caching when the K receiving users share {\Lambda}$\leq$ K helper-caches, each assisting an arbitrary number of different users. The main result is the derivation of the exact optimal worst-case del
Externí odkaz:
http://arxiv.org/abs/1809.09422
This work explores a distributed computing setting where $K$ nodes are assigned fractions (subtasks) of a computational task in order to perform the computation in parallel. In this setting, a well-known main bottleneck has been the inter-node commun
Externí odkaz:
http://arxiv.org/abs/1802.04172
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
ISIT 2020, IEEE International Symposium on Information Theory, 21-26 June 2020, Los Angeles, California, USA (Virtual Conference)
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______1093::19f03525c370ba8b6dc6bc81df6c2779
http://www.eurecom.fr/publication/6267
http://www.eurecom.fr/publication/6267