activity
20112019
most citedCasual Compressive Sensing for Gene Network Inference

23 citations · 40 across the 11 of their papers we have counts for

collaborators
Showing cs.ITShow all

6 papers · 1 filter

cs.IT2014

Poisson Group Testing: A Probabilistic Model for Boolean Compressed Sensing

Amin Emad, Olgica Milenkovic

We introduce a novel probabilistic group testing framework, termed Poisson group testing, in which the number of defectives follows a right-truncated Poisson distribution. The Pois…

cs.IT2014★ 2 cited

Code Construction and Decoding Algorithms for Semi-Quantitative Group Testing with Nonuniform Thresholds

Amin Emad, Olgica Milenkovic

We analyze a new group testing scheme, termed semi-quantitative group testing, which may be viewed as a concatenation of an adder channel and a discrete quantizer. Our focus is on…

cs.IT2012★ 10 cited

Semi-Quantitative Group Testing: A Unifying Framework for Group Testing with Applications in Genotyping

Amin Emad, Olgica Milenkovic

We propose a novel group testing method, termed semi-quantitative group testing, motivated by a class of problems arising in genome screening experiments. Semi-quantitative group t…

cs.IT2012

Semi-Quantitative Group Testing

Amin Emad, Olgica Milenkovic

We consider a novel group testing procedure, termed semi-quantitative group testing, motivated by a class of problems arising in genome sequence processing. Semi-quantitative group…

cs.IT2011★ 2 cited

Symmetric Group Testing and Superimposed Codes

Amin Emad, Jun Shen, Olgica Milenkovic

We describe a generalization of the group testing problem termed symmetric group testing. Unlike in classical binary group testing, the roles played by the input symbols zero and o…

cs.IT2011

Information Theoretic Bounds for Tensor Rank Minimization over Finite Fields

Amin Emad, Olgica Milenkovic

We consider the problem of noiseless and noisy low-rank tensor completion from a set of random linear measurements. In our derivations, we assume that the entries of the tensor bel…