10 citations · 40 across the 30 of their papers we have counts for
5 papers · 1 filter
FRANTIC: A Fast Reference-based Algorithm for Network Tomography via Compressive Sensing
Sheng Cai, Mayank Bakshi, Sidharth Jaggi +1
We study the problem of link and node delay estimation in undirected networks when at most k out of n links or nodes in the network are congested. Our approach relies on end-to-end…
GROTESQUE: Noisy Group Testing (Quick and Efficient)
Sheng Cai, Mohammad Jahangoshahi, Mayank Bakshi +1
Group-testing refers to the problem of identifying (with high probability) a (small) subset of defectives from a (large) set of items via a "small" number of "pooled" tests…
Near-Optimal Stochastic Threshold Group Testing
Chun Lam Chan, Sheng Cai, Mayank Bakshi +2
We formulate and analyze a stochastic threshold group testing problem motivated by biological applications. Here a set of items contains a subset of defective items.…
Reliable Deniable Communication: Hiding Messages in Noise
Pak Hou Che, Mayank Bakshi, Sidharth Jaggi
A transmitter Alice may wish to reliably transmit a message to a receiver Bob over a binary symmetric channel (BSC), while simultaneously ensuring that her transmission is deniable…
On AVCs with Quadratic Constraints
Farzin Haddadpour, Mahdi Jafari Siavoshani, Mayank Bakshi +1
In this work we study an Arbitrarily Varying Channel (AVC) with quadratic power constraints on the transmitter and a so-called "oblivious" jammer (along with additional AWGN) under…