| Publication | Date of Publication | Type |
|---|
Learning half-spaces on general infinite spaces equipped with a distance function
Information and Computation | 2023-03-07 | Paper |
ON DETERMINISTIC FINITE STATE MACHINES IN RANDOM ENVIRONMENTS
Probability in the Engineering and Informational Sciences | 2022-12-08 | Paper |
Large width nearest prototype classification on general distance spaces
Theoretical Computer Science | 2018-06-18 | Paper |
Large-width bounds for learning half-spaces on distance spaces
Discrete Applied Mathematics | 2018-05-24 | Paper |
Classification based on prototypes with spheres of influence
Information and Computation | 2017-09-28 | Paper |
Multi-category classifiers and sample width
Journal of Computer and System Sciences | 2016-08-04 | Paper |
A probabilistic approach to case-based inference
Theoretical Computer Science | 2015-06-01 | Paper |
A hybrid classifier based on boxes and nearest neighbors
Discrete Applied Mathematics | 2014-05-06 | Paper |
Learning bounds via sample width for classifiers on finite metric spaces
Theoretical Computer Science | 2014-03-19 | Paper |
Analysis of a multi-category classifier
Discrete Applied Mathematics | 2012-10-19 | Paper |
| On the descriptional complexity of systems and their output response | 2011-11-17 | Paper |
An empirical study of the complexity and randomness of prediction error sequences
Communications in Nonlinear Science and Numerical Simulation | 2011-09-23 | Paper |
Interaction of a self vibrating beam with chaotic external forces
Comptes Rendus. Mécanique. Académie des Sciences, Paris | 2011-07-26 | Paper |
On the algorithmic complexity of static structures
Journal of Systems Science and Complexity | 2011-06-22 | Paper |
A stochastic gradient descent algorithm for structural risk minimisation
Lecture Notes in Computer Science | 2010-02-23 | Paper |
Estimate of the number of restricted integer-partitions
Applicable Analysis and Discrete Mathematics | 2009-12-03 | Paper |
Maximal width learning of binary functions
Theoretical Computer Science | 2009-12-01 | Paper |
| Density of smooth Boolean functions | 2009-10-22 | Paper |
On the VC-dimension and boolean functions with long runs
Journal of Discrete Mathematical Sciences and Cryptography | 2009-07-14 | Paper |
On the complexity of binary samples
Annals of Mathematics and Artificial Intelligence | 2009-07-13 | Paper |
Constrained versions of Sauer's Lemma
Discrete Applied Mathematics | 2008-10-17 | Paper |
| VC-dimensions of random function classes | 2008-05-27 | Paper |
On the complexity of constrained VC-classes
Discrete Applied Mathematics | 2008-03-28 | Paper |
Information Efficiency
Lecture Notes in Computer Science | 2008-03-07 | Paper |
On the Combinatorial Representation of Information
Lecture Notes in Computer Science | 2007-09-10 | Paper |
The VC dimension of k‐uniform random hypergraphs
Random Structures & Algorithms | 2007-07-18 | Paper |
Complexity of hyperconcepts
Theoretical Computer Science | 2007-01-09 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2005-06-15 | Paper |
| scientific article; zbMATH DE number 2127765 (Why is no real title available?) | 2005-01-14 | Paper |
On learning multicategory classification with sample queries.
Information and Computation | 2004-03-14 | Paper |
On the degree of approximation by manifolds of finite pseudo-dimension
Constructive Approximation | 2001-01-30 | Paper |
On the approximation of functional classes equipped with a uniform measure using ridge functions
Journal of Approximation Theory | 2000-05-10 | Paper |
On the learnability of rich function classes
Journal of Computer and System Sciences | 1999-09-22 | Paper |
The degree of approximation of sets in euclidean space using sets with bounded Vapnik-Chervonenkis dimension
Discrete Applied Mathematics | 1998-09-27 | Paper |
On the value of partial information for learning from examples
Journal of Complexity | 1998-04-20 | Paper |
