Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > MINIMIZING DISAGREEMENT PROBLEM:
Reports tagged with minimizing disagreement problem:
TR94-025 | 12th December 1994
David P. Dobkin, Dimitrios Gunopulos

Computing the Maximum Bichromatic Discrepancy with applications to Computer Graphics and Machine Learning


Computing the maximum bichromatic discrepancy is an interesting
theoretical problem with important applications in computational
learning theory, computational geometry and computer graphics.
In this paper we give algorithms to compute the maximum
bichromatic discrepancy for simple geometric ranges, including
rectangles and halfspaces.
In addition, we give ... more >>>




ISSN 1433-8092 | Imprint