The computational complexity of densest region detection
From MaRDI portal
Recommendations
- EFFICIENT ALGORITHMS FOR THE OPTIMAL-RATIO REGION DETECTION PROBLEMS IN DISCRETE GEOMETRY WITH APPLICATIONS
- Efficient Algorithms for the Optimal-Ratio Region Detection Problems in Discrete Geometry with Applications
- Computational Complexity of Two-Dimensional Regions
- The complexity of detecting fixed-density clusters
- scientific article; zbMATH DE number 2011857
- Region intensity complexity active contours
- Calculating a linear-time solution to the densest-segment problem
- Fast algorithms for the density finding problem
Cites work
- scientific article; zbMATH DE number 3772326 (Why is no real title available?)
- scientific article; zbMATH DE number 1161563 (Why is no real title available?)
- scientific article; zbMATH DE number 3436645 (Why is no real title available?)
- scientific article; zbMATH DE number 1559516 (Why is no real title available?)
- Learning distributions by their density levels: A paradigm for learning without a teacher
- Neural Network Learning
- On a characterization of operators from \(l_ q \)into a Banach space of type p with some applications to eigenvalue problems
- On the complexity of polyhedral separability
- On the difficulty of approximately maximizing agreements.
- The densest hemisphere problem
- Universal Donsker classes and metric entropy
This page was built for publication: The computational complexity of densest region detection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1604217)