English
Related papers

Related papers: Efficient Decoding Schemes for Noisy Non-Adaptive …

200 papers

In group testing, the task is to identify defective items by testing groups of them together using as few tests as possible. We consider the setting where each item is defective with a constant probability $\alpha$, independent of all other…

Discrete Mathematics · Computer Science 2024-11-15 Lukas Hintze , Lena Krieg , Olga Scheftelowitsch , Haodong Zhu

We consider non-adaptive threshold group testing for identification of up to $d$ defective items in a set of $n$ items, where a test is positive if it contains at least $2 \leq u \leq d$ defective items, and negative otherwise. The…

Information Theory · Computer Science 2018-09-25 Thach V. Bui , Minoru Kuribayashi , Mahdi Cheraghchi , Isao Echizen

Identification of up to $d$ defective items and up to $h$ inhibitors in a set of $n$ items is the main task of non-adaptive group testing with inhibitors. To efficiently reduce the cost of this Herculean task, a subset of the $n$ items is…

Information Theory · Computer Science 2019-01-10 Thach V. Bui , Minoru Kuribayashi , Tetsuya Kojima , Isao Echizen

The goal of group testing is to efficiently identify a few specific items, called positives, in a large population of items via tests. A test is an action on a subset of items which returns positive if the subset contains at least one…

Information Theory · Computer Science 2021-11-08 Thach V. Bui , Mahdi Cheraghchi , An T. H. Nguyen , Thuc D. Nguyen

The group testing problem consists of determining a small set of defective items from a larger set of items based on a number of possibly-noisy tests, and is relevant in applications such as medical testing, communication protocols, pattern…

Information Theory · Computer Science 2023-09-19 Jonathan Scarlett , Oliver Johnson

The group testing problem consists of determining a small set of defective items from a larger set of items based on a number of possibly-noisy tests, and is relevant in applications such as medical testing, communication protocols, pattern…

Information Theory · Computer Science 2018-10-05 Jonathan Scarlett

The basic goal of threshold group testing is to identify up to $d$ defective items among a population of $n$ items, where $d$ is usually much smaller than $n$. The outcome of a test on a subset of items is positive if the subset has at…

Information Theory · Computer Science 2021-08-24 Thach V. Bui , Mahdi Cheraghchi , Isao Echizen

The group testing problem consists of determining a small set of defective items from a larger set of items based on a number of tests, and is relevant in applications such as medical testing, communication protocols, pattern matching, and…

Information Theory · Computer Science 2019-01-30 Jonathan Scarlett , Volkan Cevher

The group testing problem consists of determining a small set of defective items from a larger set of items based on a number of possibly-noisy tests, and has numerous practical applications. One of the defining features of group testing is…

Information Theory · Computer Science 2021-11-12 Bernard Teo , Jonathan Scarlett

The goal of threshold group testing is to identify up to $d$ defective items among a population of $n$ items, where $d$ is usually much smaller than $n$. A test is positive if it has at least $u$ defective items and negative otherwise. Our…

Information Theory · Computer Science 2019-01-09 Thach V. Bui , Minoru Kuribayashi , Mahdi Cheraghchi , Isao Echizen

In group testing, the goal is to identify a subset of defective items within a larger set of items based on tests whose outcomes indicate whether at least one defective item is present. This problem is relevant in areas such as medical…

Information Theory · Computer Science 2022-10-24 Eric Price , Jonathan Scarlett , Nelvin Tan

Group-testing refers to the problem of identifying (with high probability) a (small) subset of $D$ defectives from a (large) set of $N$ items via a "small" number of "pooled" tests. For ease of presentation in this work we focus on the…

Information Theory · Computer Science 2013-07-11 Sheng Cai , Mohammad Jahangoshahi , Mayank Bakshi , Sidharth Jaggi

We study the problem of estimating the number of defective items in adaptive Group testing by using a minimum number of queries. We improve the existing algorithm and prove a lower bound that show that, for constant estimation, the number…

Data Structures and Algorithms · Computer Science 2023-12-22 Nader H. Bshouty , Vivian E. Bshouty-Hurani , George Haddad , Thomas Hashem , Fadi Khoury , Omar Sharafy

Given $d$ defective items in a population of $n$ items with $d \ll n$, in threshold group testing without gap, the outcome of a test on a subset of items is positive if the subset has at least $u$ defective items and negative otherwise,…

Information Theory · Computer Science 2024-05-10 Thach V. Bui , Yeow Meng Chee , Van Khu Vu

Non-adaptive group testing refers to the problem of inferring a sparse set of defectives from a larger population using the minimum number of simultaneous pooled tests. Recent positive results for noiseless group testing have motivated the…

Information Theory · Computer Science 2021-07-16 Gabriel Arpino , Nicolò Grometto , Afonso S. Bandeira

In the classical non-adaptive group testing setup, pools of items are tested together, and the main goal of a recovery algorithm is to identify the "complete defective set" given the outcomes of different group tests. In contrast, the main…

Information Theory · Computer Science 2016-03-01 Abhay Sharma , Chandra R. Murthy

This paper considers the noisy group testing problem where among a large population of items some are defective. The goal is to identify all defective items by testing groups of items, with the minimum possible number of tests. The focus of…

Information Theory · Computer Science 2021-10-20 Esmaeil Karimi , Anoosheh Heidarzadeh , Krishna R. Narayanan , Alex Sprintson

Group testing is an approach aimed at identifying up to $d$ defective items among a total of $n$ elements. This is accomplished by examining subsets to determine if at least one defective item is present. In our study, we focus on the…

Data Structures and Algorithms · Computer Science 2023-07-12 Nader H. Bshouty , Catherine A. Haddad-Zaknoon

We consider an efficiently decodable non-adaptive group testing (NAGT) problem that meets theoretical bounds. The problem is to find a few specific items (at most $d$) satisfying certain characteristics in a colossal number of $N$ items as…

Information Theory · Computer Science 2017-11-20 Thach V. Bui , Minoru Kuribayashi , Isao Echizen

In group testing, the goal is to identify a subset of defective items within a larger set of items based on tests whose outcomes indicate whether any defective item is present. This problem is relevant in areas such as medical testing, data…

Information Theory · Computer Science 2020-11-11 Nelvin Tan , Jonathan Scarlett
‹ Prev 1 2 3 10 Next ›