Pages that link to "Item:Q1401282"
From MaRDI portal
The following pages link to Mining for empty spaces in large data sets. (Q1401282):
Displaying 9 items.
- Fast algorithms for finding disjoint subsequences with extremal densities (Q850123) (← links)
- A data mining approach for visual and analytical identification of neurorehabilitation ranges in traumatic brain injury cognitive rehabilitation (Q1668935) (← links)
- On the number of maximum empty boxes amidst \(n\) points (Q1745207) (← links)
- On the largest empty axis-parallel box amidst \(n\) points (Q1950392) (← links)
- Variations of largest rectangle recognition amidst a bichromatic point set (Q2201768) (← links)
- Drawing borders efficiently (Q2272197) (← links)
- Maximal strips data structure to represent free space on partially reconfigurable FPGAs (Q3399241) (← links)
- An Upper Bound of the Minimal Dispersion via Delta Covers (Q4611843) (← links)
- Maximal Empty Boxes Amidst Random Points (Q5891110) (← links)
