Mining for empty spaces in large data sets.
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 2080472 (Why is no real title available?)
- A new algorithm for the largest empty rectangle problem
- A note on finding a maximum empty rectangle
- Computing the Largest Empty Rectangle
- On the maximum empty rectangle problem
Cited in
(11)- A data mining approach for visual and analytical identification of neurorehabilitation ranges in traumatic brain injury cognitive rehabilitation
- scientific article; zbMATH DE number 2080472 (Why is no real title available?)
- Fast algorithms for finding disjoint subsequences with extremal densities
- On the number of maximum empty boxes amidst \(n\) points
- An upper bound of the minimal dispersion via delta covers
- Drawing borders efficiently
- Predicting relevant empty spots in social interaction
- On the largest empty axis-parallel box amidst \(n\) points
- Maximal strips data structure to represent free space on partially reconfigurable FPGAs
- Maximal empty boxes amidst random points
- Variations of largest rectangle recognition amidst a bichromatic point set
This page was built for publication: Mining for empty spaces in large data sets.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1401282)