scientific article; zbMATH DE number 5957397
From MaRDI portal
Publication:3174038
zbMATH Open1222.68091MaRDI QIDQ3174038FDOQ3174038
Publication date: 12 October 2011
Full work available at URL: http://www.jmlr.org/papers/v7/angluin06a.html
Title of this publication is not available (Why is that?)
Recommendations
- Learning Theory
- Learning a hidden graph
- Learning a hidden uniform hypergraph
- Learning a Hidden Subgraph
- Automata, Languages and Programming
- Non-adaptive learning of a hidden hypergraph
- Non-adaptive learning of a hidden hypergraph
- Learning Theory
- Learning a hidden graph using \(O(\log n)\)queries per edge
- Error-tolerant non-adaptive learning of a hidden hypergraph
Cited In (17)
- Reconstructing weighted graphs with minimal query complexity
- Learning a hidden uniform hypergraph
- Title not available (Why is that?)
- Optimal query complexity bounds for finding graphs
- Almost tight upper bound for finding Fourier coefficients of bounded pseudo-Boolean functions
- Non-adaptive Learning of a Hidden Hypergraph
- Exact learning from an honest teacher that answers membership queries
- Learning Theory
- Learning Theory
- Learning and Verifying Graphs Using Queries with a Focus on Edge Counting
- Learning Boolean halfspaces with small weights from membership queries
- Learning a hidden graph
- Reconstructing Markov processes from independent and anonymous experiments
- Learning a hidden graph using \(O(\log n)\)queries per edge
- Reconstruction of hidden graphs and threshold group testing
- Linear Time Constructions of Some $$d$$-Restriction Problems
- Non-adaptive learning of a hidden hypergraph
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3174038)
