Sharper Bounds for the Hardness of Prototype and Feature Selection
ALT '00 Proceedings of the 11th International Conference on Algorithmic Learning Theory
Self-improved gaps almost everywhere for the agnostic approximation of monomials
Theoretical Computer Science
Modalities, Relations, and Learning
RelMiCS '09/AKA '09 Proceedings of the 11th International Conference on Relational Methods in Computer Science and 6th International Conference on Applications of Kleene Algebra: Relations and Kleene Algebra in Computer Science
Hi-index | 0.00 |