Zobrazeno 1 - 10
of 1 958
pro vyhledávání: '"Rajan B"'
Autor:
T., Rashid Ummer N., Rajan, B. Sundar
Coded caching in a wireless device-to-device (D2D) network was first studied by Ji \textit{et al.} in [4] (referred to as the JCM scheme). In a D2D network, a central server first places the data in the user cache memories and all the user's demands
Externí odkaz:
http://arxiv.org/abs/2409.14350
We consider a variant of the coded caching problem where users connect to two types of caches, called private caches and access caches. The problem setting consists of a server having a library of files and a set of access caches. Every user, equippe
Externí odkaz:
http://arxiv.org/abs/2408.13165
Autor:
Muralidharan Sargurupremraj, Hideaki Suzuki, Xueqiu Jian, Chloé Sarnowski, Tavia E. Evans, Joshua C. Bis, Gudny Eiriksdottir, Saori Sakaue, Natalie Terzikhan, Mohamad Habes, Wei Zhao, Nicola J. Armstrong, Edith Hofer, Lisa R. Yanek, Saskia P. Hagenaars, Rajan B. Kumar, Erik B. van den Akker, Rebekah E. McWhirter, Stella Trompet, Aniket Mishra, Yasaman Saba, Claudia L. Satizabal, Gregory Beaudet, Laurent Petit, Ami Tsuchida, Laure Zago, Sabrina Schilling, Sigurdur Sigurdsson, Rebecca F. Gottesman, Cora E. Lewis, Neelum T. Aggarwal, Oscar L. Lopez, Jennifer A. Smith, Maria C. Valdés Hernández, Jeroen van der Grond, Margaret J. Wright, Maria J. Knol, Marcus Dörr, Russell J. Thomson, Constance Bordes, Quentin Le Grand, Marie-Gabrielle Duperron, Albert V. Smith, David S. Knopman, Pamela J. Schreiner, Denis A. Evans, Jerome I. Rotter, Alexa S. Beiser, Susana Muñoz Maniega, Marian Beekman, Julian Trollor, David J. Stott, Meike W. Vernooij, Katharina Wittfeld, Wiro J. Niessen, Aicha Soumaré, Eric Boerwinkle, Stephen Sidney, Stephen T. Turner, Gail Davies, Anbupalam Thalamuthu, Uwe Völker, Mark A. van Buchem, R. Nick Bryan, Josée Dupuis, Mark E. Bastin, David Ames, Alexander Teumer, Philippe Amouyel, John B. Kwok, Robin Bülow, Ian J. Deary, Peter R. Schofield, Henry Brodaty, Jiyang Jiang, Yasuharu Tabara, Kazuya Setoh, Susumu Miyamoto, Kazumichi Yoshida, Manabu Nagata, Yoichiro Kamatani, Fumihiko Matsuda, Bruce M. Psaty, David A. Bennett, Philip L. De Jager, Thomas H. Mosley, Perminder S. Sachdev, Reinhold Schmidt, Helen R. Warren, Evangelos Evangelou, David-Alexandre Trégouët, International Network against Thrombosis (INVENT) Consortium, International Headache Genomics Consortium (IHGC), Mohammad A. Ikram, Wei Wen, Charles DeCarli, Velandai K. Srikanth, J. Wouter Jukema, Eline P. Slagboom, Sharon L. R. Kardia, Yukinori Okada, Bernard Mazoyer, Joanna M. Wardlaw, Paul A. Nyquist, Karen A. Mather, Hans J. Grabe, Helena Schmidt, Cornelia M. Van Duijn, Vilmundur Gudnason, William T. Longstreth, Lenore J. Launer, Mark Lathrop, Sudha Seshadri, Christophe Tzourio, Hieab H. Adams, Paul M. Matthews, Myriam Fornage, Stéphanie Debette
Publikováno v:
Nature Communications, Vol 11, Iss 1, Pp 1-18 (2020)
White matter hyperintensities (WMH) are a common brain-imaging feature of cerebral small vessel disease. Here, the authors carry out a GWAS and followup analyses for WMH-volume, implicating several variants with potential for risk stratification and
Externí odkaz:
https://doaj.org/article/3d0e1a5389ab4d9387592a6316f6a661
We consider a variant of the coded caching problem where users connect to two types of caches, called private and access caches. The problem setting consists of a server with a library of files and a set of access caches. Each user, equipped with a p
Externí odkaz:
http://arxiv.org/abs/2407.00677
We consider a wireless distributed computing system based on the MapReduce framework, which consists of three phases: \textit{Map}, \textit{Shuffle}, and \textit{Reduce}. The system consists of a set of distributed nodes assigned to compute arbitrary
Externí odkaz:
http://arxiv.org/abs/2406.15791
Autor:
T., Rashid Ummer N., Rajan, B. Sundar
Coded caching scheme originally proposed by Maddah-Ali and Niesen (MN) considered a broadcast network consisting of a single server connected to a set of users each having a cache memory. Motivated by practical scenarios, Karamchandani \textit{et al.
Externí odkaz:
http://arxiv.org/abs/2405.12747
We consider a coded caching network consisting of a server with a library of $N$ files connected to $K$ users, where each user is equipped with a dedicated cache of size $M_p$ units. In addition to that, the network consists of $\Lambda\leq K$ helper
Externí odkaz:
http://arxiv.org/abs/2405.02687
This work introduces a multi-antenna coded caching problem in a two-dimensional multi-access network, where a server with $L$ transmit antennas and $N$ files communicates to $K_1K_2$ users, each with a single receive antenna, through a wireless broad
Externí odkaz:
http://arxiv.org/abs/2405.02683
Autor:
Premlal, Rohit, Rajan, B. Sundar
Function-correcting codes were introduced in the work "Function-Correcting Codes" by Lenz et al. 2023, which provides a graphical representation for the problem of constructing function-correcting codes. We use this graph to get a lower bound on the
Externí odkaz:
http://arxiv.org/abs/2404.15135
In the original coded caching model introduced by Maddah-Ali and Niesen in 2014, the server starts broadcasting only after it receives demands from all the users. So, all the users must be active during the delivery phase. In this work, we consider a
Externí odkaz:
http://arxiv.org/abs/2404.06433