Non-adaptive Learning of a Hidden Hypergraph
From MaRDI portal
Publication:2835619
DOI10.1007/978-3-319-24486-0_6zbMath1388.68145arXiv1502.04137OpenAlexW1534179339MaRDI QIDQ2835619
Nader H. Bshouty, Hasan Abasi, Hanna Mazzawi
Publication date: 30 November 2016
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1502.04137
Related Items (3)
Almost Optimal Cover-Free Families ⋮ Exact learning from an honest teacher that answers membership queries ⋮ Exact learning of juntas from membership queries
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Non-adaptive complex group testing with multiple positive sets
- Learning a hidden graph
- Families of finite sets in which no intersection of \(\ell\) sets is covered by the union of \(s\) others
- Reconstruction of hidden graphs and threshold group testing
- Learning a hidden graph using \(O(\log n)\)queries per edge
- Reconstructing a Hamiltonian cycle by querying the graph: Application to DNA physical mapping
- Sets pooling designs
- Trivial two-stage group testing for complexes using almost disjunct matrices.
- On a bound of cover-free families
- A group testing method for finding patterns in data
- Asking questions to minimize errors
- Some new bounds for cover-free families
- Construction of \(d(H)\)\,-\,disjunct matrix for group testing in hypergraphs
- A survey on nonadaptive group testing algorithms through the angle of decoding
- Families of \(k\)-independent sets
- Lower bounds for cover-free families
- Exact Learning from Membership Queries: Some Techniques, Results and New Directions
- On Exact Learning Monotone DNF from Membership Queries
- Algorithmic construction of sets for k -restrictions
- Linear Time Constructions of Some $$d$$-Restriction Problems
- Testers and their applications
- Learning and Verifying Graphs Using Queries with a Focus on Edge Counting
- Learning a Hidden Matching
- Almost Optimal Cover-Free Families
- Learning a Hidden Subgraph
- Nonrandom binary superimposed codes
- Graph-Theoretic Concepts in Computer Science
This page was built for publication: Non-adaptive Learning of a Hidden Hypergraph
