Pages that link to "Item:Q1924382"
From MaRDI portal
The following pages link to Computing the maximum bichromatic discrepancy, with applications to computer graphics and machine learning (Q1924382):
Displayed 7 items.
- Computing optimal islands (Q433119) (← links)
- PEBBL: an object-oriented framework for scalable parallel branch and bound (Q903924) (← links)
- On the difficulty of approximately maximizing agreements. (Q1401958) (← links)
- On simplifying dot maps. (Q1421029) (← links)
- A combinatorial branch-and-bound algorithm for box search (Q2339825) (← links)
- Maximum-weight planar boxes in \(O(n^2)\) time (and better) (Q2448119) (← links)
- An Improved Branch-and-Bound Method for Maximum Monomial Agreement (Q2815448) (← links)