Zobrazeno 1 - 10
of 1 339
pro vyhledávání: '"Charul"'
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
In Pliable Private Information Retrieval (PPIR) with a single server, messages are partitioned into $\Gamma$ non-overlapping classes. The user wants to retrieve a message from its desired class without revealing the identity of the desired class to t
Externí odkaz:
http://arxiv.org/abs/2404.04820
We consider two layered hierarchical coded caching problem introduced in Hierarchical coded caching, IEEE Trans. Inf. Theory, 2016, in which a server is connected to $K_1$ mirrors, and each mirror is connected to $K_2$ users. The mirrors and the user
Externí odkaz:
http://arxiv.org/abs/2312.15024
The flow near a moving contact line depends on the dynamic contact angle, viscosity ratio, and capillary number. We report experiments involving immersing a plate into a liquid bath, concurrently measuring the interface shape, interfacial velocity, a
Externí odkaz:
http://arxiv.org/abs/2311.09560
Autor:
Rajput, Charul, Rajan, B. Sundar
We consider a coded caching system in which some users are offline at the time of delivery. Such systems are called hotplug coded caching systems. A placement delivery array (PDA) is a well-known tool for constructing a coded caching scheme for dedic
Externí odkaz:
http://arxiv.org/abs/2311.02856
Ong and Ho developed optimal linear index codes for single uniprior index coding problems (ICPs) by finding a spanning tree for each of the strongly connected components of the corresponding information-flow graphs, following which Thomas et al. cons
Externí odkaz:
http://arxiv.org/abs/2303.10460
Autor:
Chadha, Charul1 (AUTHOR) charulc2@illinois.edu, Olaivar, Gabriel2 (AUTHOR) olaivar2@illinois.edu, Mahrous, Mahmoud A.3 (AUTHOR) mahrous2@illinois.edu, Patterson, Albert E.4,5 (AUTHOR) aepatterson5@exchange.tamu.edu, Jasiuk, Iwona1 (AUTHOR) charulc2@illinois.edu
Publikováno v:
Materials (1996-1944). Jun2024, Vol. 17 Issue 11, p2677. 17p.
Autor:
Abeyrathna, K. Darshana, Abouzeid, Ahmed Abdulrahem Othman, Bhattarai, Bimal, Giri, Charul, Glimsdal, Sondre, Granmo, Ole-Christoffer, Jiao, Lei, Saha, Rupsa, Sharma, Jivitesh, Tunheim, Svein Anders, Zhang, Xuan
Tsetlin machine (TM) is a logic-based machine learning approach with the crucial advantages of being transparent and hardware-friendly. While TMs match or surpass deep learning accuracy for an increasing number of applications, large clause pools ten
Externí odkaz:
http://arxiv.org/abs/2301.08190
Autor:
Rajput, Charul, Rajan, B. Sundar
In this paper, we propose a scheme for the problem of cache-aided multi-user private information retrieval with small caches, in which $K$ users are connected to $S$ non-colluding databases via shared links. Each database contains a set of $N$ files,
Externí odkaz:
http://arxiv.org/abs/2212.12888