Interactive learning of a dynamic structure
From MaRDI portal
Cites work
- 10.1162/153244303321897654
- A framework for searching in graphs in the presence of errors
- Binary search in graphs revisited
- Clustering with Interactive Feedback
- Deterministic and probabilistic binary search in graphs
- Local algorithms for interactive clustering
- Nonstochastic Multi-Armed Bandits with Graph-Structured Feedback
- Optimally sorting evolving data
- Quadratic time algorithms appear to be optimal for sorting evolving data
- Sorting and selection on dynamic data
This page was built for publication: Interactive learning of a dynamic structure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7025141)