Results 181 to 190 of about 481 (210)
DMRU: generative deep learning to unravel condition-specific cytosine methylation in plants. [PDF]
Gupta S +4 more
europepmc +1 more source
On the greedy coded caching scheme
Coded caching is a technique that receives much attention in the network literature, since it is able to achieve significant gains compared to the conventional uncoded caching schemes. In this paper, we first identify a family of placement and delivery schemes. Then we derive a lower bound on the average rate for the identified schemes.
Qifa Yan +2 more
openaire +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
A Generalized Grouping Scheme in Coded Caching
IEEE Transactions on Communications, 2019Coded caching, which could significantly reduce the maximum amount of transmission rate during the peak traffic times in wireless network, has been widely studied recently. Apart from the transmission rate, sub-packetization $F$ reflecting the implementation complexity, is also concerned in coded caching. The grouping method proposed by Shanmugam
Minquan Cheng, Jing Jiang, Qiang Wang
exaly +2 more sources
Decentralized Coded Caching Scheme With Heterogeneous File Sizes
IEEE Transactions on Vehicular Technology, 2020Coded caching is an effective technique to reduce peak network traffic load by exploiting coded multicasting opportunities among users with all possible requests. However, most existing works on coded caching design assume identical file sizes. In this paper, to fully exploit the coded multicasting opportunities in decentralized coded caching system ...
Lei Zheng, Qingchun Chen, Qifa Yan
exaly +2 more sources
A novel centralized coded caching scheme for edge caching basestation
Journal of Systems Architecture, 2022Minquan Cheng +2 more
exaly +2 more sources
Low subpacketization schemes for coded caching
2017 IEEE International Symposium on Information Theory (ISIT), 2017Coded caching is a technique that generalizes conventional caching and promises significant reductions in traffic over caching networks. However, the basic coded caching scheme requires that each file hosted in the server be partitioned into a large number (called the subpacketization level) of non-overlapping subfiles.
Li Tang 0004, Aditya Ramamoorthy
openaire +2 more sources
An Efficient Delivery Scheme for Coded Caching
2015 27th International Teletraffic Congress, 2015We consider a network with several users trying to access a database of files stored at a server through a shared link. Each user is equipped with a cache, where files can be prefetched according to a caching policy which is mainly based on the popularities of the files. Coded caching tries to exploit coding opportunities created by cooperative caching
Abinesh Ramakrishnan +2 more
openaire +1 more source
Pareto Optimal Schemes in Coded Caching
2019 IEEE International Symposium on Information Theory (ISIT), 2019Maddah-Ali and Niesen, in a seminal work, initiated the study of rate memory tradeoff for a canonical cache network which operates via a placement phase and a delivery phase. While considering the case of placement phase being uncoded, Yu et al. proved the surprising result of the existence of a universal code, a code which is simultaneously optimal ...
Vijith Kumar K. P +2 more
openaire +1 more source

