Pages that link to "Item:Q1079570"
From MaRDI portal
The following pages link to A note on finding a maximum empty rectangle (Q1079570):
Displayed 14 items.
- A new algorithm for the largest empty rectangle problem (Q582097) (← links)
- Fast algorithms for finding disjoint subsequences with extremal densities (Q850123) (← links)
- Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions (Q943838) (← links)
- An efficient algorithm for maxdominance, with applications (Q1115629) (← links)
- Efficient algorithms for the largest rectangle problem (Q1193696) (← links)
- Mining for empty spaces in large data sets. (Q1401282) (← 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)
- Dual-bounded generating problems: Efficient and inefficient points for discrete probability distributions and sparse boxes for multidimensional data (Q2373724) (← links)
- Fast sequential and parallel algorithms for finding the largest rectangle separating two sets (Q3210919) (← links)
- (Q5743404) (← links)
- Maximal Empty Boxes Amidst Random Points (Q5891110) (← links)
- An efficient algorithm for computing the maximum empty rectangle in three dimensions (Q5938672) (← links)
- Fast parallel algorithms for the maximum empty rectangle problem. (Q5955753) (← links)