Search Results - "Diggavi, Suhas N."

Models and Information-Theoretic Bounds for Nanopore Sequencing by Mao, Wei, Diggavi, Suhas N., Kannan, Sreeram

“…Nanopore sequencing is an emerging new technology for sequencing Deoxyribonucleic acid (DNA), which can read long fragments of DNA (~50 000 bases), in contrast…”
Get full text

Community-aware group testing by Nikolopoulos, Pavlos, Srinivasavaradhan, Sundara Rajan, Guo, Tao, Fragouli, Christina, Diggavi, Suhas

“…Group testing is a technique that can reduce the number of tests needed to identify infected members in a population, by pooling together multiple diagnostic…”
Get full text

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

Degrees of Freedom of Cache-Aided Wireless Interference Networks by Hachem, Jad, Niesen, Urs, Diggavi, Suhas N.

“…We study the role of caches in wireless interference networks. We focus on content caching and delivery across a Gaussian interference network, where both…”
Get full text

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

“…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

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

“…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

Data Encoding for Byzantine-Resilient Distributed Optimization by Data, Deepesh, Song, Linqi, Diggavi, Suhas N.

“…We study distributed optimization in the presence of Byzantine adversaries, where both data and computation are distributed among <inline-formula> <tex-math…”
Get full text

Byzantine-Resilient High-Dimensional Federated Learning by Data, Deepesh, Diggavi, Suhas

“…We study stochastic gradient descent (SGD) with local iterations in the presence of Byzantine clients, motivated by federated learning. The clients, instead of…”
Get full text

Qsparse-Local-SGD: Distributed SGD With Quantization, Sparsification, and Local Computations by Basu, Debraj, Data, Deepesh, Karakus, Can, Diggavi, Suhas N.

“…Communication bottleneck has been identified as a significant issue in distributed optimization of large-scale learning models. Recently, several approaches to…”
Get full text

Generalized Degrees Freedom of Noncoherent MIMO Channels With Asymmetric Link Strengths by Sebastian, Joyson, Diggavi, Suhas N.

“…We study the generalized degrees of freedom (gDoF) of block-fading noncoherent multiple input multiple output (MIMO) channels with asymmetric distributions of…”
Get full text

Algorithms for Reconstruction Over Single and Multiple Deletion Channels by Srinivasavaradhan, Sundara Rajan, Du, Michelle, Diggavi, Suhas N., Fragouli, Christina

“…Recent advances in DNA sequencing technology and DNA storage systems have rekindled the interest in deletion channels. Multiple recent works have looked at…”
Get full text

Wireless Network Information Flow: A Deterministic Approach by Avestimehr, A S, Diggavi, S N, Tse, D N C

“…In a wireless network with a single source and a single destination and an arbitrary number of relay nodes, what is the maximum rate of information flow…”
Get full text

Approximately Achieving Gaussian Relay Network Capacity With Lattice-Based QMF Codes by Ozgur, Ayfer, Diggavi, Suhas N.

“…Recently, a new relaying strategy, quantize-map-and-forward (QMF) scheme, has been demonstrated to approximately achieve (within an additive constant number of…”
Get full text

Caching With Partial Adaptive Matching by Hachem, Jad, Karamchandani, Nikhil, Moharir, Sharayu, Diggavi, Suhas N.

“…We study the caching problem when we are allowed to match each user to one of a subset of caches after its request is revealed. We focus on non-uniformly…”
Get full text

Harnessing Bursty Interference in Multicarrier Systems With Output Feedback by Mishra, Shaunak, I-Hsiang Wang, Diggavi, Suhas N.

“…We study parallel two-user interference channels when the interference is bursty and feedback is available from the respective receivers. Presence of…”
Get full text

Matched Multiuser Gaussian Source Channel Communications via Uncoded Schemes by Chao Tian, Jun Chen, Diggavi, Suhas N., Shitz, Shlomo Shamai

“…We investigate whether uncoded schemes are optimal for Gaussian sources on multiuser Gaussian channels. Particularly, we consider two problems: the first is to…”
Get full text

Capacity Results for Multicasting Nested Message Sets Over Combination Networks by Saeedi Bidokhti, Shirin, Prabhakaran, Vinod M., Diggavi, Suhas N.

“…The problem of multicasting two nested messages is studied over a class of networks known as combination networks. A source multicasts two messages, a common…”
Get full text

SLATE: A Secure Lightweight Entity Authentication Hardware Primitive by Wang, Wei-Che, Yona, Yair, Wu, Yizhang, Diggavi, Suhas N., Gupta, Puneet

“…Lightweight cryptography has become more and more important in recent years because of the rise of the Internet of Things (IoT) and usage of smart mobile…”
Get full text

Wiretapped Oblivious Transfer by Mishra, Manoj, Dey, Bikash Kumar, Prabhakaran, Vinod M., Diggavi, Suhas N.

“…In this paper, we study the problem of obtaining 1-of-2 string oblivious transfer (OT) between users Alice and Bob, in the presence of a passive eavesdropper…”
Get full text

The Approximate Capacity of the Gaussian n-Relay Diamond Network by Niesen, U., Diggavi, S. N.

“…We consider the Gaussian "diamond" or parallel relay network, in which a source node transmits a message to a destination node with the help of N relays. Even…”
Get full text