Zobrazeno 1 - 10
of 106
pro vyhledávání: '"Petros Elia"'
Publikováno v:
Entropy, Vol 26, Iss 6, p 448 (2024)
The work here studies the communication cost for a multi-server multi-task distributed computation framework, as well as for a broad class of functions and data statistics. Considering the framework where a user seeks the computation of multiple comp
Externí odkaz:
https://doaj.org/article/76eafab5c6d14fe096d963986d744be5
Publikováno v:
IEEE Transactions on Wireless Communications
IEEE Transactions on Wireless Communications, 2023, 22 (4), pp.2683-2698. ⟨10.1109/TWC.2022.3213475⟩
IEEE Transactions on Wireless Communications, 2023, 22 (4), pp.2683-2698. ⟨10.1109/TWC.2022.3213475⟩
The recent introduction of vector coded caching has revealed that multi-rank transmissions in the presence of receiver-side cache content can dramatically ameliorate the file-size bottleneck of coded caching and substantially boost performance in err
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8eabcb9d9077adc588bbfcc81d9856bb
https://doi.org/10.1109/twc.2022.3213475
https://doi.org/10.1109/twc.2022.3213475
Autor:
Federico Brunero, Petros Elia
Publikováno v:
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory, 2023, 69 (2), pp.1037-1056. ⟨10.1109/TIT.2022.3193723⟩
IEEE Transactions on Information Theory, 2023, 69 (2), pp.1037-1056. ⟨10.1109/TIT.2022.3193723⟩
This work identifies the fundamental limits of Multi-Access Coded Caching (MACC) where each user is connected to multiple caches in a manner that follows a generalized combinatorial topology. This topology stands out as it allows for unprecedented co
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::552ae487a15242a42af1b072a9281c2c
https://doi.org/10.1109/tit.2022.3193723
https://doi.org/10.1109/tit.2022.3193723
Publikováno v:
IEEE/ACM Transactions on Networking
IEEE/ACM Transactions on Networking, In press, pp.1-16. ⟨10.1109/TNET.2023.3270567⟩
IEEE/ACM Transactions on Networking, In press, pp.1-16. ⟨10.1109/TNET.2023.3270567⟩
International audience; This work elevates coded caching networks from their purely information-theoretic framework to a stochastic setting, by exploring the effect of random user activity and by exploiting correlations in the activity patterns of di
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::110a75f372eeee797461820fabc06cab
https://hal.science/hal-04087726/document
https://hal.science/hal-04087726/document
Autor:
Emanuele Parrinello, Seyed Pooya Shariatpanahi, Mohammad Javad Salehi, Petros Elia, Antti Tolli
Publikováno v:
IEEE Transactions on Wireless Communications
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:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ffa990d50beb6cc99187ae5ca14bfd03
https://doi.org/10.1109/twc.2021.3119772
https://doi.org/10.1109/twc.2021.3119772
Autor:
Berksan Serbetci, Eleftherios Lampiris, Thrasyvoulos Spyropoulos, Giuseppe Caire, Petros Elia
Publikováno v:
IEEE/ACM Transactions on Networking. :1-16
This work presents a new way of exploiting non-uniform file popularity in coded caching networks. Focusing on a fully-connected fully-interfering wireless setting with multiple cache-enabled transmitters and receivers, we show how non-uniform file po
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::464418f46ed6f85a6eabe91300207e85
https://doi.org/10.1109/tnet.2022.3219161
https://doi.org/10.1109/tnet.2022.3219161
Autor:
Ali Khalesi, Petros Elia
Publikováno v:
ITW 2022, IEEE Information Theory Workshop, 1-9 November 2022, Mumbai, India
ITW 2022, IEEE Information Theory Workshop, 1-9 November 2022, Mumbai, India, IEEE, Nov 2022, Mumbai, India. pp.428-433, ⟨10.1109/ITW54588.2022.9965859⟩
ITW 2022, IEEE Information Theory Workshop, 1-9 November 2022, Mumbai, India, IEEE, Nov 2022, Mumbai, India. pp.428-433, ⟨10.1109/ITW54588.2022.9965859⟩
In this work, we investigate the problem of multiuser linearly separable function computation, where N servers help compute the desired functions (jobs) of K users. In this setting each desired function can be written as a linear combination of up to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::90996610156bfcc159d27e3dcee43814
https://hal.science/hal-04094954
https://hal.science/hal-04094954
Autor:
Petros Elia, Ali Khalesi
In this work, we explore the problem of multi-user linearly-separable distributed computation, where $N$ servers help compute the desired functions (jobs) of $K$ users, and where each desired function can be written as a linear combination of up to $
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::96d00d36cb3e858d83e096aab3400bf4
http://arxiv.org/abs/2206.11119
http://arxiv.org/abs/2206.11119
Publikováno v:
IMDEA Networks Institute Digital Repository
instname
instname
We investigate the performance of coded caching in land mobile-satellite (LMS) systems, where a satellite station with full access to a content library serves K cache-aided land users. The promising gains that coded caching provides for the error-fre
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::636bf38194de5cb54979f5d987d15bd4
https://hdl.handle.net/20.500.12761/1595
https://hdl.handle.net/20.500.12761/1595
Autor:
Eleftherios Lampiris, Petros Elia
Publikováno v:
IEEE Transactions on Information Theory
2018 IEEE Information Theory Workshop (ITW)
ITW
2018 IEEE Information Theory Workshop (ITW)
ITW
Within the context of coded caching, the work reveals the interesting connection between having multiple transmitters and having heterogeneity in the cache sizes of the receivers. Our work effectively shows that having multiple transmit antennas -- w
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3c0a36b877b46e5edecc43a836b6868c
https://doi.org/10.1109/tit.2020.3015348
https://doi.org/10.1109/tit.2020.3015348