| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 9657172 | Journal of Computer and System Sciences | 2005 | 29 Pages |
Abstract
For technical reasons these results are achieved using various formal conditions concerning the learnability of unions of uniformly learnable classes. Therefore numerous sufficient properties for the learnability of such unions are presented and illustrated with several examples.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Sandra Zilles,