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.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 453-470 |
| Number of pages | 18 |
| Journal | Journal of Computer and System Sciences |
| Volume | 52 |
| Issue number | 3 |
| DOIs | |
| State | Published - Jun 1996 |
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- General Computer Science
- Computer Networks and Communications
- Computational Theory and Mathematics
- Applied Mathematics
Fingerprint
Dive into the research topics of 'Computing the maximum bichromatic discrepancy, with applications to computer graphics and machine learning'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver