The following pages link to (Q5395177):
Displaying 50 items.
- Adaptive group testing with a constrained number of positive responses improved (Q266968) (← links)
- Constraining the number of positive responses in adaptive, non-adaptive, and two-stage group testing (Q346522) (← links)
- Finding one of \(D\) defective elements in some group testing models (Q375957) (← links)
- Synthetic sequence design for signal location search (Q378252) (← links)
- Improved constructions for non-adaptive threshold group testing (Q378256) (← links)
- Two new perspectives on multi-stage group testing (Q378258) (← links)
- Efficient two-stage group testing algorithms for genetic screening (Q378260) (← links)
- Non-negative least squares for high-dimensional linear models: consistency and sparse recovery without regularization (Q391843) (← links)
- Non-adaptive complex group testing with multiple positive sets (Q393127) (← links)
- Pooling semilattices and non-adaptive pooling designs (Q394365) (← links)
- A generalization of Macula's disjunct matrices (Q411221) (← links)
- On a group testing problem: characterization of graphs with 2-complexity and maximum number of edges (Q411849) (← links)
- Learning a hidden graph (Q479267) (← links)
- A new strongly competitive group testing algorithm with small sequentiality (Q492805) (← links)
- Interval group testing for consecutive positives (Q526226) (← links)
- A construction of pooling designs with surprisingly high degree of error correction (Q549251) (← links)
- New error-correcting pooling designs associated with finite vector spaces (Q604880) (← links)
- Constructing error-correcting pooling designs with symplectic space (Q613666) (← links)
- Approaching pooling design with smaller efficient ratio (Q620527) (← links)
- DNA library screening, pooling design and unitary spaces (Q621839) (← links)
- A generalization of the formulas for intersection numbers of dual polar association schemes and their applications (Q624531) (← links)
- Pooling designs with surprisingly high degree of error correction in a finite vector space (Q713313) (← links)
- Reconstruction of hidden graphs and threshold group testing (Q719032) (← links)
- Rapid, large-scale, and effective detection of COVID-19 via non-adaptive testing (Q827753) (← links)
- Improvements on some error-tolerance pooling designs (Q906429) (← links)
- Pooling spaces associated with finite geometry (Q932830) (← links)
- An upper bound of the number of tests in pooling designs for the error-tolerant complex model (Q941032) (← links)
- A construction of \(d^z\)-disjunct matrices in a dual space of symplectic space (Q947128) (← links)
- Error-correcting pooling designs associated with some distance-regular graphs (Q967358) (← links)
- Nonadaptive group testing with lies: probabilistic existence theorems (Q984649) (← links)
- Pooling designs associated with unitary space and ratio efficiency comparison (Q987500) (← links)
- Non-unique probe selection and group testing (Q995556) (← links)
- More on pooling spaces (Q998372) (← links)
- Transforming an error-tolerant separable matrix to an error-tolerant disjunct matrix (Q1003685) (← links)
- The minimum number of \(e\)-vertex-covers among hypergraphs with \(e\) edges of given ranks (Q1003769) (← links)
- Searching for an edge in a graph with restricted test sets (Q1024439) (← links)
- On the upper bounds of the minimum number of rows of disjunct matrices (Q1024738) (← links)
- Nonadaptive algorithms for threshold group testing (Q1028130) (← links)
- Edge search in graphs with restricted test sets (Q1045083) (← links)
- A construction of \(d^z\)-disjunct matrices by orthogonal space and discussion on their design parameters (Q1045094) (← links)
- On optimal policy in the group testing with incomplete identification (Q1644181) (← links)
- Exact learning of juntas from membership queries (Q1663645) (← links)
- Non-adaptive learning of a hidden hypergraph (Q1704557) (← links)
- Adaptive search for one defective in the additive group testing model (Q1752314) (← links)
- Smart elements in combinatorial group testing problems (Q1752611) (← links)
- Anzahl formulas of subspaces in symplectic spaces and their applications (Q1947093) (← links)
- An NP-completeness result of edge search in graphs (Q2014718) (← links)
- A recovery algorithm and pooling designs for one-stage noisy group testing under the probabilistic framework (Q2061995) (← links)
- Random and quasi-random designs in group testing (Q2156803) (← links)
- Group testing problem with two defectives (Q2262985) (← links)
