On the power of polynomial discriminators and radial basis function networks
COLT '93 Proceedings of the sixth annual conference on Computational learning theory
Geometric Properties of Naive Bayes in Nominal Domains
EMCL '01 Proceedings of the 12th European Conference on Machine Learning
Unconditional lower bounds for learning intersections of halfspaces
Machine Learning
Learning intersections of halfspaces with a margin
Journal of Computer and System Sciences
Extremal properties of polynomial threshold functions
Journal of Computer and System Sciences
Computational Complexity
Polynomials that Sign Represent Parity and Descartes' Rule of Signs
Computational Complexity
On the coverings of the d-cube for d≤6
Discrete Applied Mathematics
Optimal bounds for sign-representing the intersection of two halfspaces by polynomials
Proceedings of the forty-second ACM symposium on Theory of computing
Representing boolean functions using polynomials: more can offer less
ISNN'11 Proceedings of the 8th international conference on Advances in neural networks - Volume Part III
Cuts, c-cuts, and c-complexes over the n-cube
INOC'11 Proceedings of the 5th international conference on Network optimization
Geometric implications of the naive Bayes assumption
UAI'96 Proceedings of the Twelfth international conference on Uncertainty in artificial intelligence
Improved lower bounds for learning intersections of halfspaces
COLT'06 Proceedings of the 19th annual conference on Learning Theory
Generalization error bounds for the logical analysis of data
Discrete Applied Mathematics
Lower bound on weights of large degree threshold functions
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
Low-weight halfspaces for sparse boolean vectors
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Hi-index | 0.01 |