Zobrazeno 1 - 10
of 71
pro vyhledávání: '"Salim El Rouayheb"'
Autor:
Rawad Bitar, Yuxuan Xing, Yasaman Keshtkarjahromi, Venkat Dasari, Salim El Rouayheb, Hulya Seferoglu
Publikováno v:
EURASIP Journal on Wireless Communications and Networking, Vol 2021, Iss 1, Pp 1-25 (2021)
Abstract Edge computing is emerging as a new paradigm to allow processing data near the edge of the network, where the data is typically generated and collected. This enables critical computations at the edge in applications such as Internet of Thing
Externí odkaz:
https://doaj.org/article/c8dbb55b9637476ca2b08c9ed93d1144
Publikováno v:
IEEE Journal on Selected Areas in Communications. 41:929-940
We consider the problem of a Parameter Server (PS) that wishes to learn a model that fits data distributed on the nodes of a graph. We focus on Federated Learning (FL) as a canonical application. One of the main challenges of FL is the communication
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::299e4b3fa9023437e168e6b93ef5c995
https://doi.org/10.1109/jsac.2023.3244250
https://doi.org/10.1109/jsac.2023.3244250
Publikováno v:
ICASSP 2023 - 2023 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f76d60ad85edfff58d62606b65a00397
https://doi.org/10.1109/icassp49357.2023.10096363
https://doi.org/10.1109/icassp49357.2023.10096363
Autor:
Salim El Rouayheb, Serge Kas Hanna
Publikováno v:
IEEE Transactions on Information Theory. 67:2206-2216
We consider the problem of constructing binary codes for correcting deletions that are localized within certain parts of the codeword that are unknown a priori. The model that we study is when $\delta \leq w$ deletions are localized in a window of si
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::04a95b43dfe420922092ee3838ec98ce
https://doi.org/10.1109/tit.2021.3051532
https://doi.org/10.1109/tit.2021.3051532
We consider straggler-resilient learning. In many previous works, e.g., in the coded computing literature, straggling is modeled as random delays that are independent and identically distributed between workers. However, in many practical scenarios,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::808bf4af3e70058675997da29b044d52
http://arxiv.org/abs/2111.13877
http://arxiv.org/abs/2111.13877
Autor:
Yingying Chen, Yilin Yang, Salim El Rouayheb, Rafael G. L. D'Oliveira, Hulya Seferoglu, Xin Yang
Publikováno v:
SECON
Distributed computation plays an essential role in cloud and edge computing. Data such as images, audio, and text can be represented as matrices to facilitate efficient computation, especially in the domains of distributed machine learning, computer
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e68c4cd94c363573e47398dc016331cd
https://doi.org/10.1109/secon52354.2021.9491589
https://doi.org/10.1109/secon52354.2021.9491589
Autor:
Salim El Rouayheb, Serge Kas Hanna
Publikováno v:
IEEE Transactions on Information Theory. 65:3-15
We consider the problem of constructing codes that can correct $\delta$ deletions occurring in an arbitrary binary string of length $n$ bits. Varshamov-Tenengolts (VT) codes, dating back to 1965, are zero-error single deletion $(\delta=1)$ correcting
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9ef827a8927b909fb0636dcc3a253b63
https://doi.org/10.1109/tit.2018.2841936
https://doi.org/10.1109/tit.2018.2841936
Publikováno v:
ITW
We consider the problem of secure distributed matrix multiplication (SDMM) in which a user wishes to compute the product of two matrices with the assistance of honest but curious servers. We construct polynomial codes for SDMM by studying a recently
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::94724f24d611e48c7c473cb7c27518dc
We consider the problem of ON-OFF privacy in which a user is interested in the latest message generated by one of n sources available at a server. The user has the choice to turn privacy ON or OFF depending on whether he wants to hide his interest at
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5b5d2f246895281a4d6164b7a73adbc0
We consider the problem of communication efficient secure distributed matrix multiplication. The previous literature has focused on reducing the number of servers as a proxy for minimizing communication costs. The intuition being that the more server
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::01cc54e4b3209da742cacb549ae270ad