Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > DETAIL:

Paper:

TR94-025 | 12th December 1994 00:00

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

RSS-Feed




TR94-025
Authors: David P. Dobkin, Dimitrios Gunopulos
Publication: 12th December 1994 00:00
Downloads: 1337
Keywords: 


Abstract:


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 extensions to other discrepancy problems.



ISSN 1433-8092 | Imprint