Sorting noisy data with partial information
From MaRDI portal
Publication:2986898
DOI10.1145/2422436.2422492zbMath1362.68293OpenAlexW1974184113MaRDI QIDQ2986898
Yury Makarychev, Konstantin Makarychev, Aravindan Vijayaraghavan
Publication date: 16 May 2017
Published in: Proceedings of the 4th conference on Innovations in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2422436.2422492
Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Related Items (7)
Approximation algorithm for min-max correlation clustering problem with outliers ⋮ Approximation algorithms for the lower bounded correlation clustering problem ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Partitioning Well-Clustered Graphs: Spectral Clustering Works! ⋮ Approximate minimum selection with unreliable comparisons ⋮ A literature review on correlation clustering: cross-disciplinary taxonomy with bibliometric analysis
Cites Work
- Teachability in computational learning
- Measuring teachability using variants of the teaching dimension
- Teaching a smarter learner.
- Occam's razor
- Pseudorandom generators for space-bounded computation
- On the power of inductive inference from good examples
- A model of interactive teaching
- Learning from different teachers
- On the limits of efficient teachability
- In search of an easy witness: Exponential time vs. probabilistic polynomial time.
- On the complexity of teaching
- On specifying Boolean functions by labelled examples
- Recent Developments in Algorithmic Teaching
- A theory of the learnable
- Teaching Randomized Learners
- Algorithmic Learning Theory
- A theory of goal-oriented communication
- Derandomizing polynomial identity tests means proving circuit lower bounds
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Sorting noisy data with partial information
