7 citations · 8 across the 2 of their papers we have counts for
2 papers
cs.IT2013★ 7 cited
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.…
cs.IT2012★ 1 cited
SHO-FA: Robust compressive sensing with order-optimal complexity, measurements, and bits
Mayank Bakshi, Sidharth Jaggi, Sheng Cai +1
Suppose x is any exactly k-sparse vector in R^n. We present a class of sparse matrices A, and a corresponding algorithm that we call SHO-FA (for Short and Fast) that, with high pro…