- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| j16 |      | Martin Anthony, Joel Ratsaby: Robust cutpoints in the logical analysis of numerical data. Discrete Applied Mathematics 160(4-5): 355-364 (2012) |
| j15 | | Martin Anthony, Joel Ratsaby: Analysis of a multi-category classifier. Discrete Applied Mathematics 160(16-17): 2329-2338 (2012) |
| c9 | | Martin Anthony, Joel Ratsaby: The performance of a new hybrid classifier based on boxes and nearest neighbors. ISAIM 2012 |
| 2011 | ||
| j14 | | Joel Ratsaby: On the sysRatio and its critical point. Mathematical and Computer Modelling 53(5-6): 939-944 (2011) |
| 2010 | ||
| j13 | | Martin Anthony, Joel Ratsaby: Maximal width learning of binary functions. Theor. Comput. Sci. 411(1): 138-147 (2010) |
| i10 | | |
| i9 | | László Kovács, Joel Ratsaby: Descriptive-complexity based distance for fuzzy sets. CoRR abs/1012.3410 (2010) |
| 2009 | ||
| i8 | | |
| i7 | | |
| i6 | | |
| i5 | | |
| 2008 | ||
| j12 | | |
| j11 | | Joel Ratsaby: On the complexity of constrained VC-classes. Discrete Applied Mathematics 156(6): 903-910 (2008) |
| j10 | | Joel Ratsaby: Constrained versions of Sauer's lemma. Discrete Applied Mathematics 156(14): 2753-2767 (2008) |
| j9 | | Bernard Ycart, Joel Ratsaby: VC-Dimensions of Random Function Classes. Discrete Mathematics & Theoretical Computer Science 10(1) (2008) |
| j8 | | Joel Ratsaby: An Algorithmic Complexity Interpretation of Lin's Third Law of Information Theory. Entropy 10(1): 6-14 (2008) |
| r1 | | |
| i4 | | |
| i3 | | |
| i2 | | Joel Ratsaby: An algorithmic complexity interpretation of Lin's third law of information theory. CoRR abs/0802.4089 (2008) |
| i1 | | Joel Ratsaby, Joël Chaskalovic: Algorithmic complexity and randomness in elastic solids. CoRR abs/0811.0623 (2008) |
| 2007 | ||
| j7 | | Bernard Ycart, Joel Ratsaby: The VC dimension of k-uniform random hypergraphs. Random Struct. Algorithms 30(4): 564-572 (2007) |
| c8 | | |
| 2006 | ||
| j6 | | |
| c7 | | |
| 2004 | ||
| c6 | | |
| 2003 | ||
| j5 | | Joel Ratsaby: On learning multicategory classification with sample queries. Inf. Comput. 185(2): 298-327 (2003) |
| c5 | | Joel Ratsaby: A Stochastic Gradient Descent Algorithm for Structural Risk Minimisation. ALT 2003: 205-220 |
| 1999 | ||
| j4 | | Joel Ratsaby, Vitaly Maiorov: On the Learnability of Rich Function Classes. J. Comput. Syst. Sci. 58(1): 183-192 (1999) |
| 1998 | ||
| j3 | | Vitaly Maiorov, Joel Ratsaby: The Degree of Approximation of Sets in Euclidean Space Using Sets with Bounded Vapnik-Chervonenkis Dimension. Discrete Applied Mathematics 86(1): 81-93 (1998) |
| j2 | | Joel Ratsaby: Incremental Learning With Sample Queries. IEEE Trans. Pattern Anal. Mach. Intell. 20(8): 883-888 (1998) |
| 1997 | ||
| j1 | | Joel Ratsaby, Vitaly Maiorov: On the Value of Partial Information for Learning from Examples. J. Complexity 13(4): 509-543 (1997) |
| c4 | | Joel Ratsaby, Vitaly Maiorov: Generalization of the PAC-Model for Learning with Partial Information. EuroCOLT 1997: 51-65 |
| c3 |  | |
| 1996 | ||
| c2 | | Joel Ratsaby, Ron Meir, Vitaly Maiorov: Towards Robust Model Selection Using Estimation and Approximation Error Bounds. COLT 1996: 57-67 |
| 1995 | ||
| c1 | | Joel Ratsaby, Santosh S. Venkatesh: Learning from a Mixture of Labeled and Unlabeled Examples with Parametric Side Information. COLT 1995: 412-417 |
| 1 | Martin Anthony | |
| 2 | Joël Chaskalovic | |
| 3 | László Kovács | |
| 4 | Vitaly Maiorov (V. E. Maiorov) | |
| 5 | Ron Meir (Ronny Meir, R. S. Meir) | |
| 6 | Santosh S. Venkatesh | |
| 7 | Bernard Ycart |
Data released under the ODC-BY 1.0 license — See also our legal information page