Computing the Maximum Bichromatic Discrepancy, with Applications to Computer Graphics and Machine Learning
β Scribed by David P. Dobkin; Dimitrios Gunopulos; Wolfgang Maass
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 794 KB
- Volume
- 52
- Category
- Article
- ISSN
- 0022-0000
No coin nor oath required. For personal study only.
β¦ Synopsis
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.
π SIMILAR VOLUMES
## Abstract Significant improvements in calculational efficiency and capability with the selfβconsistent electron pairs (SCEP) method has resulted from several new computational developments. A new procedure for constructing the important internal Coulomb and exchange operators has substantially re