Pages that link to "Item:Q1885819"

The following pages link to A group testing method for finding patterns in data (Q1885819):

Displaying 14 items.

• A new strongly competitive group testing algorithm with small sequentiality (Q492805) (← links)
• An upper bound of the number of tests in pooling designs for the error-tolerant complex model (Q941032) (← links)
• Non-adaptive learning of a hidden hypergraph (Q1704557) (← links)
• Hypothesis group testing for disjoint pairs (Q2426661) (← links)
• A survey on nonadaptive group testing algorithms through the angle of decoding (Q2426664) (← links)
• An unexpected meeting of four seemingly unrelated problems: graph testing, DNA complex screening, superimposed codes and secure key distribution (Q2471071) (← links)
• Exact learning from an honest teacher that answers membership queries (Q2636406) (← links)
• Non-adaptive Learning of a Hidden Hypergraph (Q2835619) (← links)
• Linear Time Constructions of Some $$d$$-Restriction Problems (Q2947011) (← links)
• Bounds for the Number of Tests in Non-adaptive Randomized Algorithms for Group Testing (Q3297759) (← links)
• ERROR-TOLERANT TRIVIAL TWO-STAGE GROUP TESTING FOR COMPLEXES USING ALMOST SEPARABLE AND ALMOST DISJUNCT MATRICES (Q3397514) (← links)
• (Q5005098) (← links)
• Almost Optimal Cover-Free Families (Q5283363) (← links)
• Optimal deterministic group testing algorithms to estimate the number of defectives (Q5918294) (← links)