Publications by Chien-Yi Wang | EPFL Graph Search

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Information-Theoretic Caching: The Multi-User Case

Michael Christoph Gastpar, Sung Hoon Lim, Chien-Yi Wang

In this paper, we consider a cache aided network in which each user is assumed to have individual caches, while upon users’ requests, an update message is sent through a common link to all users. First, we formulate a general information theoretic setting ...

Institute of Electrical and Electronics Engineers2017

Information Theoretic Caching: The Multi-User Case

Michael Christoph Gastpar, Sung Hoon Lim, Chien-Yi Wang

In this paper, we present information theoretic inner and outer bounds on the fundamental tradeoff between cache memory size and update rate in a multi-user cache network. Each user is assumed to have individual caches, while upon users’ requests, an updat ...

Ieee2016

Information-Theoretic Caching: Sequential Coding for Computing

Michael Christoph Gastpar, Sung Hoon Lim, Chien-Yi Wang

Under the paradigm of caching, partial data are delivered before the actual requests of users are known. In this paper, this problem is modeled as a canonical distributed source coding problem with side information, where the side information represents th ...

Institute of Electrical and Electronics Engineers2016

A New Converse Bound for Coded Caching

Michael Christoph Gastpar, Sung Hoon Lim, Chien-Yi Wang

An information-theoretic lower bound is developed for the caching system studied by Maddah-Ali and Niesen. By comparing the proposed lower bound with the decentralized coded caching scheme of Maddah-Ali and Niesen, the optimal memory--rate tradeoff is char ...

2016

Information-Theoretic Caching

Michael Christoph Gastpar, Sung Hoon Lim, Chien-Yi Wang

Motivated by the caching problem introduced by Maddah-Ali and Niesen, a problem of distributed source coding with side information is formulated, which captures a distinct interesting aspect of caching. For the single-user case, a single-letter characteriz ...

2015

Interactive Computation of Type-Threshold Functions in Collocated Gaussian Networks

Michael Christoph Gastpar, Chien-Yi Wang

In wireless sensor networks, various applications involve learning one or multiple functions of the measurements observed by sensors, rather than the measurements themselves. This paper focuses on the class of type-threshold functions, e.g., the maximum an ...

Institute of Electrical and Electronics Engineers2015

Computation Over Gaussian Networks With Orthogonal Components

Michael Christoph Gastpar, Chien-Yi Wang

Function computation over Gaussian networks with orthogonal components is studied for arbitrarily correlated discrete memoryless sources. Two classes of functions are considered: 1) the arithmetic sum function and 2) the type function. The arithmetic sum f ...

Institute of Electrical and Electronics Engineers2014

Approximate Ergodic Capacity of a Class of Fading Two-User Two-Hop Networks

Michael Christoph Gastpar, Chien-Yi Wang

The fading AWGN two-user two-hop network is considered where the channel coefficients are independent and identically distributed (i.i.d.) according to a continuous distribution and vary over time. For a broad class of channel distributions, the ergodic su ...

Institute of Electrical and Electronics Engineers2014

On Distributed Successive Refinement with Lossless Recovery

Michael Christoph Gastpar, Chien-Yi Wang

The problem of successive refinement in distributed source coding and in joint source-channel coding is considered. The emphasis is placed on the case where the sources have to be recovered losslessly in the second stage. In distributed source coding, it i ...

2014

Chien-Yi Wang

Graph Chatbot

Chat with Graph Search

Information-Theoretic Caching: The Multi-User Case

Information Theoretic Caching: The Multi-User Case

Information-Theoretic Caching: Sequential Coding for Computing

A New Converse Bound for Coded Caching

Function Computation over Networks

Information-Theoretic Caching

Interactive Computation of Type-Threshold Functions in Collocated Gaussian Networks

Computation Over Gaussian Networks With Orthogonal Components

Approximate Ergodic Capacity of a Class of Fading Two-User Two-Hop Networks

On Distributed Successive Refinement with Lossless Recovery

Information-Theoretic Caching: The Multi-User Case

Function Computation over Networks

Approximate Ergodic Capacity of a Class of Fading Two-User Two-Hop Networks

On Distributed Successive Refinement with Lossless Recovery

Interactive Computation of Type-Threshold Functions in Collocated Gaussian Networks

Computation Over Gaussian Networks With Orthogonal Components

Information-Theoretic Caching: Sequential Coding for Computing

A New Converse Bound for Coded Caching

Information-Theoretic Caching

Information Theoretic Caching: The Multi-User Case