Search Results - "Karamchandani, Nikhil"

Refine Results
  1. 1

    Coded Caching for Multi-level Popularity and Access by Hachem, Jad, Karamchandani, Nikhil, Diggavi, Suhas N.

    Published in IEEE transactions on information theory (01-05-2017)
    “…To address the exponentially rising demand for wireless content, the use of caching is emerging as a potential solution. It has been recently established that…”
    Get full text
    Journal Article
  2. 2

    Secure State Estimation Against Sensor Attacks in the Presence of Noise by Mishra, Shaunak, Shoukry, Yasser, Karamchandani, Nikhil, Diggavi, Suhas N., Tabuada, Paulo

    “…We consider the problem of estimating the state of a noisy linear dynamical system when an unknown subset of sensors is arbitrarily corrupted by an adversary…”
    Get full text
    Journal Article
  3. 3

    Network Coding for Computing: Cut-Set Bounds by Appuswamy, R, Franceschetti, M, Karamchandani, N, Zeger, K

    Published in IEEE transactions on information theory (01-02-2011)
    “…The following network computing problem is considered. Source nodes in a directed acyclic network generate independent messages and a single receiver node…”
    Get full text
    Journal Article
  4. 4
  5. 5

    Rate-Memory Trade-off for Multi-Access Coded Caching With Uncoded Placement by Reddy, Kota Srinivas, Karamchandani, Nikhil

    Published in IEEE transactions on communications (01-06-2020)
    “…We study a multi-access variant of the popular coded caching framework, which consists of a central server with a catalog of <inline-formula> <tex-math…”
    Get full text
    Journal Article
  6. 6

    Hierarchical Coded Caching by Karamchandani, Nikhil, Niesen, Urs, Maddah-Ali, Mohammad Ali, Diggavi, Suhas N.

    Published in IEEE transactions on information theory (01-06-2016)
    “…Caching of popular content during off-peak hours is a strategy to reduce network loads during peak hours. Recent work has shown significant benefits of…”
    Get full text
    Journal Article
  7. 7

    On the regret of online edge service hosting by Prakash, R. Sri, Karamchandani, Nikhil, Moharir, Sharayu

    Published in Performance evaluation (01-11-2023)
    “…We consider the problem of service hosting where a service provider can dynamically rent edge resources via short term contracts to ensure better quality of…”
    Get full text
    Journal Article
  8. 8

    Fixed confidence community mode estimation by Pai, Meera, Karamchandani, Nikhil, Nair, Jayakrishnan

    Published in Performance evaluation (01-11-2023)
    “…Our aim is to estimate the largest community (a.k.a., mode) in a population composed of multiple disjoint communities. This estimation is performed in a fixed…”
    Get full text
    Journal Article
  9. 9

    Effect of number of users in multi-level coded caching by Hachem, Jad, Karamchandani, Nikhil, Diggavi, Suhas

    “…It has been recently established that joint design of content delivery and storage (coded caching) can significantly improve performance over conventional…”
    Get full text
    Conference Proceeding Journal Article
  10. 10

    On Gradient Coding With Partial Recovery by Sarmasarkar, Sahasrajit, Lalitha, V., Karamchandani, Nikhil

    Published in IEEE transactions on communications (01-02-2023)
    “…We consider a generalization of the gradient coding framework where a dataset is divided across <inline-formula> <tex-math notation="LaTeX">n…”
    Get full text
    Journal Article
  11. 11

    Content caching and delivery over heterogeneous wireless networks by Hachem, Jad, Karamchandani, Nikhil, Diggavi, Suhas

    “…Emerging heterogeneous wireless architectures consist of a dense deployment of local-coverage wireless access points (APs) with high data rates, along with…”
    Get full text
    Conference Proceeding
  12. 12

    Fundamental Limits of Demand-Private Coded Caching by Gurjarpadhye, Chinmay, Ravi, Jithin, Kamath, Sneha, Dey, Bikash Kumar, Karamchandani, Nikhil

    Published in IEEE transactions on information theory (01-06-2022)
    “…We consider the coded caching problem with an additional privacy constraint that a user should not get any information about the demands of the other users. We…”
    Get full text
    Journal Article
  13. 13
  14. 14

    Resource Pooling in Large-Scale Content Delivery Systems by Reddy, Kota Srinivas, Moharir, Sharayu, Karamchandani, Nikhil

    Published in IEEE transactions on communications (01-03-2020)
    “…Content delivery networks are a key infrastructure component used by Video on Demand (VoD) services to deliver content over the Internet. We study a content…”
    Get full text
    Journal Article
  15. 15

    Private Coded Caching by Ravindrakumar, Vaishakh, Panda, Parthasarathi, Karamchandani, Nikhil, Prabhakaran, Vinod M.

    “…Recent work by Maddah-Ali and Niesen (2014) introduced coded caching which demonstrated the benefits of joint design of storage and transmission policies in…”
    Get full text
    Journal Article
  16. 16

    Flag Manifold-Based Precoder Interpolation Techniques for MIMO-OFDM Systems by Nijhawan, Sarthak, Gupta, Agrim, Appaiah, Kumar, Vaze, Rahul, Karamchandani, Nikhil

    Published in IEEE transactions on communications (01-07-2021)
    “…The use of channel state information (CSI) at the transmitter significantly enhances the performance of wireless communication systems. However, the…”
    Get full text
    Journal Article
  17. 17

    Towards a Distributed Caching Service at the WiFi Edge Using Wi-Cache by Chhangte, Lalhruaizela, Karamchandani, Nikhil, Manjunath, D., Viterbo, Emanuele

    “…Caching content close to the end users, e.g., at cellular base stations (BSs), WiFi access points (APs), and end user devices is known to improve efficiency…”
    Get full text
    Journal Article
  18. 18

    Content replication in large distributed caches by Moharir, Sharayu, Karamchandani, Nikhil

    “…In this paper, we consider the algorithmic task of content replication and request routing in a distributed caching system consisting of a central server and a…”
    Get full text
    Conference Proceeding
  19. 19

    Greedy k-Center From Noisy Distance Samples by Jali, Neharika, Karamchandani, Nikhil, Moharir, Sharayu

    “…We study a variant of the canonical <inline-formula><tex-math notation="LaTeX">k</tex-math></inline-formula>-center problem over a set of vertices in a metric…”
    Get full text
    Journal Article
  20. 20

    Greedy [Formula Omitted]-Center From Noisy Distance Samples by Jali, Neharika, Karamchandani, Nikhil, Moharir, Sharayu

    “…We study a variant of the canonical [Formula Omitted]-center problem over a set of vertices in a metric space, where the underlying distances are apriori…”
    Get full text
    Journal Article