Computing the maximum bichromatic discrepancy, with applications to computer graphics and machine learning
From MaRDI portal
Publication:1924382
DOI10.1006/jcss.1996.0034zbMath0858.68077OpenAlexW2027929257MaRDI QIDQ1924382
Dimitrios Gunopulos, David P. Dobkin, Wolfgang Maass
Publication date: 26 November 1996
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcss.1996.0034
Learning and adaptive systems in artificial intelligence (68T05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items
Distance bounds for high dimensional consistent digital rays and 2-D partially-consistent digital rays, Supervised box clustering, On the difficulty of approximately maximizing agreements., PEBBL: an object-oriented framework for scalable parallel branch and bound, Variations of largest rectangle recognition amidst a bichromatic point set, Computing optimal islands, On simplifying dot maps., Maximum-weight planar boxes in \(O(n^2)\) time (and better), Planar maximum-box problem revisited, New results on the coarseness of bicolored point sets, An Improved Branch-and-Bound Method for Maximum Monomial Agreement, A combinatorial branch-and-bound algorithm for box search, Multilinear sets with two monomials and cardinality constraints
