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):
Displaying 14 items.
- Computing optimal islands (Q433119) (← links)
- New results on the coarseness of bicolored point sets (Q522958) (← 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)
- Planar maximum-box problem revisited (Q1749536) (← links)
- Multilinear sets with two monomials and cardinality constraints (Q2097167) (← links)
- Distance bounds for high dimensional consistent digital rays and 2-D partially-consistent digital rays (Q2172660) (← links)
- Variations of largest rectangle recognition amidst a bichromatic point set (Q2201768) (← links)
- A combinatorial branch-and-bound algorithm for box search (Q2339825) (← links)
- Supervised box clustering (Q2418297) (← 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)
- Approximating Bicolored Images from Discrete Projections (Q3003545) (← links)
