Communications of the ACM
Topologically sweeping an arrangement
Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
Maximizing the predictive value of production rules
Artificial Intelligence
Discrepancy and &egr; approximations for bounded VC-dimension
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Toward efficient agnostic learning
COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
A Further Comparison of Splitting Rules for Decision-Tree Induction
Machine Learning
Decision theoretic generalizations of the PAC model for neural net and other learning applications
Information and Computation
Efficient agnostic PAC-learning with simple hypothesis
COLT '94 Proceedings of the seventh annual conference on Computational learning theory
Learning unions of convex polygons
Euro-COLT '93 Proceedings of the first European conference on Computational learning theory
More or less efficient agnostic learning of convex polygons
COLT '95 Proceedings of the eighth annual conference on Computational learning theory
Journal of Computer and System Sciences
Computing the discrepancy with applications to supersampling patterns
ACM Transactions on Graphics (TOG)
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Machine Learning
More or less efficient agnostic learning of convex polygons
COLT '95 Proceedings of the eighth annual conference on Computational learning theory
PAC learning intersections of halfspaces with membership queries (extended abstract)
COLT '96 Proceedings of the ninth annual conference on Computational learning theory
A Fast Algorithm for Discovering Optimal String Patterns in Large Text Databases
ALT '98 Proceedings of the 9th International Conference on Algorithmic Learning Theory
Intrinsic Complexity of Learning Geometrical Concepts from Positive Data
COLT '01/EuroCOLT '01 Proceedings of the 14th Annual Conference on Computational Learning Theory and and 5th European Conference on Computational Learning Theory
Intrinsic complexity of learning geometrical concepts from positive data
Journal of Computer and System Sciences
Computational Geometry: Theory and Applications - Special issue on computational geometry - EWCG'02
k-Fold unions of low-dimensional concept classes
Information Processing Letters
Approximation algorithms for minimizing empirical error by axis-parallel hyperplanes
ECML'05 Proceedings of the 16th European conference on Machine Learning
On the coarseness of bicolored point sets
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |