The computational complexity of densest region detection

DOI10.1006/jcss.2001.1797zbMath1006.68058OpenAlexW1964108907MaRDI QIDQ1604217

Hans Ulrich Simon, Shai Ben-David, Nadav Eiron

Publication date: 4 July 2002

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcss.2001.1797

zbMATH Keywords

computational complexityunsupervised learningmachine learning

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (1)

Robust fitting in computer vision: easy or hard?

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Universal Donsker classes and metric entropy
• On the complexity of polyhedral separability
• The densest hemisphere problem
• Learning distributions by their density levels: A paradigm for learning without a teacher
• On the difficulty of approximately maximizing agreements.
• On a characterization of operators from \(l_ q \)into a Banach space of type p with some applications to eigenvalue problems
• Neural Network Learning

This page was built for publication: The computational complexity of densest region detection