Skip to main navigation
Skip to search
Skip to main content
Princeton University Home
Help & FAQ
Link opens in a new tab
Search content at Princeton University
Home
Profiles
Research units
Facilities
Projects
Research output
Press/Media
Caching with time-varying popularity profiles
B. N. Bharath
, K. G. Nagananda
, D. Gündúz
,
H. V. Poor
Electrical and Computer Engineering
Center for Statistics & Machine Learning
High Meadows Environmental Institute
Research output
:
Chapter in Book/Report/Conference proceeding
›
Chapter
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Caching with time-varying popularity profiles'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Caching
100%
Time-varying Popularity
100%
Loss Difference
66%
Poisson
33%
Updating Algorithm
33%
Performance Analysis
33%
Cost Function
33%
Caching Scheme
33%
Bernoulli
33%
Heterogeneous Wireless Networks
33%
Cache Performance
33%
Time-invariant
33%
Mixing Coefficient
33%
Probably Approximately Correct
33%
High Probability Bound
33%
Rademacher Complexity
33%
Content Caching
33%
Small-cell Base Stations
33%
Optimal Offloading
33%
Cache Update
33%
Periodic Update
33%
Computer Science
Update Algorithm
100%
Performance Analysis
100%
Wireless Network
100%