Nearly Optimal Sparse Group Testing
暂无分享,去创建一个
Sidharth Jaggi | Samson Zhou | Elena Grigorescu | Venkata Gandikota | S. Jaggi | V. Gandikota | Samson Zhou | Elena Grigorescu
[1] Sidharth Jaggi,et al. Nearly optimal sparse group testing , 2016, 2016 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton).
[2] D. Du,et al. Combinatorial Group Testing and Its Applications , 1993 .
[3] George Atia,et al. Boolean Compressed Sensing and Noisy Group Testing , 2009, IEEE Transactions on Information Theory.
[4] Sidharth Jaggi,et al. Novel Impossibility Results for Group-Testing , 2018, 2018 IEEE International Symposium on Information Theory (ISIT).
[5] Mayank Bakshi,et al. GROTESQUE: Noisy Group Testing (Quick and Efficient) , 2013, 2013 51st Annual Allerton Conference on Communication, Control, and Computing (Allerton).
[6] Mahdi Cheraghchi,et al. Noise-resilient group testing: Limitations and constructions , 2008, Discret. Appl. Math..
[7] Graham Cormode,et al. What's hot and what's not: tracking most frequent items dynamically , 2003, TODS.
[8] Matthew Aldridge,et al. Improved group testing rates with constant column weight designs , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).
[9] Venkatesh Saligrama,et al. Non-adaptive group testing: Explicit bounds and novel algorithms , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.
[10] Yonggang Wen,et al. Non-Adaptive Fault Diagnosis for All-Optical Networks via Combinatorial Group Testing on Graphs , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.
[11] Tadashi Wadayama,et al. Comments on “Nonadaptive Group Testing Based on Sparse Pooling Graphs” , 2018, IEEE Transactions on Information Theory.
[12] Ayfer Özgür,et al. Sparse group testing codes for low-energy massive random access , 2017, 2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton).
[13] Volkan Cevher,et al. Near-Optimal Noisy Group Testing via Separate Decoding of Items , 2018, IEEE Journal of Selected Topics in Signal Processing.
[14] Amin Karbasi,et al. Group Testing With Probabilistic Tests: Theory, Design and Application , 2010, IEEE Transactions on Information Theory.
[15] Ely Porat,et al. Search Methodologies , 2022 .
[16] Matthew Aldridge,et al. Individual Testing Is Optimal for Nonadaptive Group Testing in the Linear Regime , 2018, IEEE Transactions on Information Theory.
[17] Wenhao Huang,et al. Group testing with prior statistics , 2014, 2014 IEEE International Symposium on Information Theory.
[18] Arkadii G. D'yachkov,et al. A survey of superimposed code theory , 1983 .
[19] Matthew Aldridge,et al. The capacity of adaptive group testing , 2013, 2013 IEEE International Symposium on Information Theory.
[20] Arya Mazumdar,et al. Nonadaptive Group Testing With Random Set of Defectives , 2015, IEEE Transactions on Information Theory.
[21] Annalisa De Bonis. Efficient Group Testing Algorithms with a Constrained Number of Positive Responses , 2014, COCOA.
[22] Kannan Ramchandran,et al. SAFFRON: A fast, efficient, and robust framework for group testing based on sparse-graph codes , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).
[23] Mayank Bakshi,et al. Efficient Algorithms for Noisy Group Testing , 2017, IEEE Transactions on Information Theory.
[24] M. Mézard,et al. Group Testing with Random Pools: Phase Transitions and Optimal Strategy , 2007, 0711.2242.
[25] Arya Mazumdar,et al. Group Testing Schemes From Codes and Designs , 2015, IEEE Transactions on Information Theory.
[26] Richard C. Singleton,et al. Nonrandom binary superimposed codes , 1964, IEEE Trans. Inf. Theory.
[27] Matthew Aldridge,et al. Group Testing Algorithms: Bounds and Simulations , 2013, IEEE Transactions on Information Theory.
[28] Volkan Cevher,et al. Limits on Support Recovery With Probabilistic Models: An Information-Theoretic Framework , 2015, IEEE Transactions on Information Theory.
[29] Matthew Aldridge,et al. Performance of Group Testing Algorithms With Near-Constant Tests Per Item , 2016, IEEE Transactions on Information Theory.
[30] Tadashi Wadayama. Nonadaptive Group Testing Based on Sparse Pooling Graphs , 2017, IEEE Transactions on Information Theory.
[31] Volkan Cevher,et al. Phase Transitions in Group Testing , 2016, SODA.
[32] Anthony J. Macula,et al. A simple construction of d-disjunct matrices with certain constant weights , 1996, Discret. Math..
[33] A. Sterrett. On the Detection of Defective Members of Large Populations , 1957 .
[34] Olgica Milenkovic,et al. Symmetric group testing and superimposed codes , 2011, 2011 IEEE Information Theory Workshop.
[35] Sidharth Jaggi,et al. Non-Adaptive Group Testing: Explicit Bounds and Novel Algorithms , 2014, IEEE Trans. Inf. Theory.
[36] Ely Porat,et al. Explicit Nonadaptive Combinatorial Group Testing Schemes , 2011, IEEE Trans. Inf. Theory.
[37] Omer Gurewitz,et al. Secure Group Testing , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).
[38] Arkadii G. D'yachkov,et al. Bounds on the rate of disjunctive codes , 2013, 2014 IEEE International Symposium on Information Theory.
[39] Samuel Zaidman,et al. Advanced Calculus: An Introduction to Mathematical Analysis , 1997 .
[40] Mayank Bakshi,et al. Stochastic threshold group testing , 2013, 2013 IEEE Information Theory Workshop (ITW).
[41] A. Sebő. ON TWO RANDOM SEARCH PROBLEMS , 1985 .
[42] P. Erdös,et al. Families of finite sets in which no set is covered by the union ofr others , 1985 .