-
1
-
-
77949579043
-
Noisy group testing: An information theoretic perspective
-
Monticello, IL,Sep.
-
G. Atia and V. Saligrama, "Noisy group testing: An information theoretic perspective," in 47th Annu. Allerton Conf. Commun., Control, Comput., Monticello, IL, Sep. 2009, pp. 355-362.
-
(2009)
47th Annu. Allerton Conf. Commun., Control, Comput.
, pp. 355-362
-
-
Atia, G.1
Saligrama, V.2
-
4
-
-
0001243071
-
The detection of defective members of large populations
-
R. Dorfman, "The detection of defective members of large populations," Ann. Math. Stat., vol. 14, pp. 436-440, 1943.
-
(1943)
Ann. Math. Stat.
, vol.14
, pp. 436-440
-
-
Dorfman, R.1
-
5
-
-
57849154890
-
Spectrum enforcement and liability assignment in cognitive radio systems
-
Chicago, IL,Oct.
-
G. Atia, A. Sahai, and V. Saligrama, "Spectrum enforcement and liability assignment in cognitive radio systems," in Proc. IEEE Dynamic Spectrum Access Netw. (DySpAN), Chicago, IL, Oct. 2008.
-
(2008)
Proc. IEEE Dynamic Spectrum Access Netw. (DySpAN)
-
-
Atia, G.1
Sahai, A.2
Saligrama, V.3
-
6
-
-
57849151934
-
Codes to unmask spectrum violators
-
Pacific Grove, CA, Oct.
-
G. Atia, V. Saligrama, and A. Sahai, "Codes to unmask spectrum violators," in Asilomar Conf. Signals, Systems and Computers, Pacific Grove, CA, Oct. 2008, pp. 1575-1578.
-
(2008)
Asilomar Conf. Signals, Systems and Computers
, pp. 1575-1578
-
-
Atia, G.1
Saligrama, V.2
Sahai, A.3
-
7
-
-
33645712892
-
Compressed sensing
-
Apr.
-
D. L. Donoho, "Compressed sensing," IEEE Trans. Inf. Theory, vol. 52, no. 4, pp. 1289-1306, Apr. 2006.
-
(2006)
IEEE Trans. Inf. Theory
, vol.52
, Issue.4
, pp. 1289-1306
-
-
Donoho, D.L.1
-
8
-
-
33745604236
-
Stable signal recovery from incomplete and inaccurate measurements
-
E. J. Candes, J. Romberg, and T. Tao, "Stable signal recovery from incomplete and inaccurate measurements," Commun. Pure Appl. Math., vol. 59, pp. 1207-1223, 2005.
-
(2005)
Commun. Pure Appl. Math.
, vol.59
, pp. 1207-1223
-
-
Candes, E.J.1
Romberg, J.2
Tao, T.3
-
9
-
-
51649127785
-
Information-theoretic bounds on sparsity recovery in the high-dimensional and noisy setting
-
Nice, France,Jun.
-
M. Wainwright, "Information-theoretic bounds on sparsity recovery in the high-dimensional and noisy setting," in Int. Symp. Information Theory, Nice, France, Jun. 2007, pp. 961-965.
-
(2007)
Int. Symp. Information Theory
, pp. 961-965
-
-
Wainwright, M.1
-
10
-
-
47849105797
-
Sharp thresholds for high-dimensional and noisy sparsity recovery using -constrained quadratic programs
-
Monticello, IL
-
M. J. Wainwright, "Sharp thresholds for high-dimensional and noisy sparsity recovery using -constrained quadratic programs," presented at the Allerton Conf. Communication, Control, and Comput., Monticello, IL, 2006.
-
(2006)
Presented at the Allerton Conf. Communication, Control, and Comput.
-
-
Wainwright, M.J.1
-
11
-
-
77953817248
-
A note on optimal support recovery in compressed sensing
-
Monterey, CA,Nov.
-
G. Reeves and M. C. Gastpar, "A note on optimal support recovery in compressed sensing," in 43rd Annu. IEEE Asilomar Conf. Signals, Systems, and Comput., Monterey, CA, Nov. 2009, pp. 1576-1580.
-
(2009)
43rd Annu. IEEE Asilomar Conf. Signals, Systems, and Comput.
, pp. 1576-1580
-
-
Reeves, G.1
Gastpar, M.C.2
-
12
-
-
70449505052
-
Necessary and sufficient conditions for sparsity pattern recovery
-
Dec.
-
A. K. Fletcher, S. Rangan, and V. K. Goyal, "Necessary and sufficient conditions for sparsity pattern recovery," IEEE Trans. Inf. Theory, vol. 55, no. 12, pp. 5758-5772, Dec. 2009.
-
(2009)
IEEE Trans. Inf. Theory
, vol.55
, Issue.12
, pp. 5758-5772
-
-
Fletcher, A.K.1
Rangan, S.2
Goyal, V.K.3
-
13
-
-
33846796161
-
Denoising by sparse approximation: Error bounds based on rate-distortion theory
-
A. K. Fletcher, S. Rangan, V. K. Goyal, and K. Ramchandran, "Denoising by sparse approximation: Error bounds based on rate-distortion theory," EURASIP J. Appl. Signal Process., pp. 1-19, 2006.
-
(2006)
EURASIP J. Appl. Signal Process.
, pp. 1-19
-
-
Fletcher, A.K.1
Rangan, S.2
Goyal, V.K.3
Ramchandran, K.4
-
14
-
-
0000987928
-
Nonrandom binary superimposed codes
-
Oct.
-
W. H. Kautz and R. C. Singleton, "Nonrandom binary superimposed codes," IEEE Trans. Inf. Theory, vol. 10, no. 4, pp. 363-377, Oct. 1964.
-
(1964)
IEEE Trans. Inf. Theory
, vol.10
, Issue.4
, pp. 363-377
-
-
Kautz, W.H.1
Singleton, R.C.2
-
15
-
-
0020890649
-
A survey of superimposed code theory
-
A. G. Dyachkov and V. V. Rykov, "A survey of superimposed code theory," Probl. Control Inf. Theory, vol. 12, no. 4, pp. 1-13, 1983.
-
(1983)
Probl. Control Inf. Theory
, vol.12
, Issue.4
, pp. 1-13
-
-
Dyachkov, A.G.1
Rykov, V.V.2
-
16
-
-
51249175955
-
Family of finite sets in which no set is covered by the union of n others
-
P. Erdös, P. Frankl, and Z. Füredi, "Family of finite sets in which no set is covered by the union of n others," Isr. J. Math., vol. 51, pp. 79-89, 1985.
-
(1985)
Isr. J. Math.
, vol.51
, pp. 79-89
-
-
Erdös, P.1
Frankl, P.2
Füredi, Z.3
-
17
-
-
33846817132
-
Exploring the missing link among d-separable, -separable and -disjunct matrices
-
H.-B. Chen and F. K. Hwang, "Exploring the missing link among d-separable, -separable and -disjunct matrices," Discrete Appl. Math., vol. 155, no. 5, pp. 662-664, 2007.
-
(2007)
Discrete Appl. Math.
, vol.155
, Issue.5
, pp. 662-664
-
-
Chen, H.-B.1
Hwang, F.K.2
-
18
-
-
0038430262
-
Bounds of the length of disjunct codes
-
A. G. Dyachkov, V. V. Rykov, and A. M. Rashad, "Bounds of the length of disjunct codes," Probl. Control Inf. Theory, vol. 11, pp. 7-13, 1982.
-
(1982)
Probl. Control Inf. Theory
, vol.11
, pp. 7-13
-
-
Dyachkov, A.G.1
Rykov, V.V.2
Rashad, A.M.3
-
19
-
-
51249175955
-
Family of finite sets in which no set is covered by the union of n others
-
M. Ruszinkó, "Family of finite sets in which no set is covered by the union of n others," Isr. J. Math., vol. 51, pp. 79-89, 1985.
-
(1985)
Isr. J. Math.
, vol.51
, pp. 79-89
-
-
Ruszinkó, M.1
-
20
-
-
0010917386
-
On two random search problems
-
A. Sebo, "On two random search problems," J. Statist. Plan. Inference, vol. 11, pp. 23-31, 1985.
-
(1985)
J. Statist. Plan. Inference
, vol.11
, pp. 23-31
-
-
Sebo, A.1
-
21
-
-
0036649488
-
Asymptotic efficiency of two-stage disjunctive testing
-
Jul.
-
T. Berger and V. I. Levenshtein, "Asymptotic efficiency of two-stage disjunctive testing," IEEE Trans. Inf. Theory, vol. 48, no. 7, pp. 1741-1749, Jul. 2002.
-
(2002)
IEEE Trans. Inf. Theory
, vol.48
, Issue.7
, pp. 1741-1749
-
-
Berger, T.1
Levenshtein, V.I.2
-
22
-
-
70349696280
-
Group testing and sparse signal recovery
-
Pacific Grove, CA
-
A. C. Gilbert, M. A. Iwen, and M. J. Strauss, "Group testing and sparse signal recovery," presented at the 42nd Asilomar Conf. Signals, Systems and Comput., Pacific Grove, CA, 2008.
-
(2008)
Presented at the 42nd Asilomar Conf. Signals, Systems and Comput.
-
-
Gilbert, A.C.1
Iwen, M.A.2
Strauss, M.J.3
-
25
-
-
84857775316
-
A mutual information characterization for sparse signal processing
-
Zurich, Switzerland, Jul.
-
G. Atia and V. Saligrama, "A mutual information characterization for sparse signal processing," presented at the 38th Int. Colloquium on Automata, Languages and Programming, Zurich, Switzerland, Jul. 2011.
-
(2011)
Presented at the 38th Int. Colloquium on Automata, Languages and Programming
-
-
Atia, G.1
Saligrama, V.2
-
26
-
-
77956674627
-
Information theoretic bounds for compressed sensing
-
Oct.
-
S. Aeron, V. Saligrama, and M. Zhao, "Information theoretic bounds for compressed sensing," IEEE Trans. Inf. Theory, vol. 56, no. 10, pp. 5111-5130, Oct. 2010.
-
(2010)
IEEE Trans. Inf. Theory
, vol.56
, Issue.10
, pp. 5111-5130
-
-
Aeron, S.1
Saligrama, V.2
Zhao, M.3
-
28
-
-
77957262284
-
Screening design for non-symmetric response function
-
M. B. Malyutov, P. S. Mateev, and M. Zhao, "Screening design for non-symmetric response function," Mat. Zemetki, vol. 27, pp. 109-127, 1980.
-
(1980)
Mat. Zemetki
, vol.27
, pp. 109-127
-
-
Malyutov, M.B.1
Mateev, P.S.2
Zhao, M.3
|