Computing the maximum bichromatic discrepancy, with applications to computer graphics and machine learning
From MaRDI portal
Publication:1924382
DOI10.1006/jcss.1996.0034zbMath0858.68077MaRDI 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
68T05: Learning and adaptive systems in artificial intelligence
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
Related Items
Computing optimal islands, New results on the coarseness of bicolored point sets, PEBBL: an object-oriented framework for scalable parallel branch and bound, On the difficulty of approximately maximizing agreements., On simplifying dot maps., Planar maximum-box problem revisited, Multilinear sets with two monomials and cardinality constraints, Distance bounds for high dimensional consistent digital rays and 2-D partially-consistent digital rays, Variations of largest rectangle recognition amidst a bichromatic point set, A combinatorial branch-and-bound algorithm for box search, Supervised box clustering, Maximum-weight planar boxes in \(O(n^2)\) time (and better), An Improved Branch-and-Bound Method for Maximum Monomial Agreement
