| |
| 2009 | ||
|---|---|---|
| 24 | EE | Joel Ratsaby: How random are a learner's mistakes? CoRR abs/0903.3667: (2009) |
| 2008 | ||
| 23 | EE | Joel Ratsaby: PAC Learning. Encyclopedia of Algorithms 2008 |
| 22 | EE | Joel Ratsaby: On the complexity of binary samples. Ann. Math. Artif. Intell. 52(1): 55-65 (2008) |
| 21 | EE | Joel Ratsaby: Information Width CoRR abs/0801.4790: (2008) |
| 20 | EE | Joel Ratsaby: On the Complexity of Binary Samples CoRR abs/0801.4794: (2008) |
| 19 | EE | Joel Ratsaby: An algorithmic complexity interpretation of Lin's third law of information theory CoRR abs/0802.4089: (2008) |
| 18 | EE | Joel Ratsaby, J. Chaskalovic: Algorithmic complexity and randomness in elastic solids CoRR abs/0811.0623: (2008) |
| 17 | EE | Joel Ratsaby: Constrained versions of Sauer's lemma. Discrete Applied Mathematics 156(14): 2753-2767 (2008) |
| 16 | EE | Joel Ratsaby: On the complexity of constrained VC-classes. Discrete Applied Mathematics 156(6): 903-910 (2008) |
| 2007 | ||
| 15 | EE | Joel Ratsaby: Information Efficiency. SOFSEM (1) 2007: 475-487 |
| 14 | EE | Bernard Ycart, Joel Ratsaby: The VC dimension of k-uniform random hypergraphs. Random Struct. Algorithms 30(4): 564-572 (2007) |
| 2006 | ||
| 13 | EE | Joel Ratsaby: On the Combinatorial Representation of Information. COCOON 2006: 479-488 |
| 12 | EE | Joel Ratsaby: Complexity of hyperconcepts. Theor. Comput. Sci. 363(1): 2-10 (2006) |
| 2004 | ||
| 11 | EE | Joel Ratsaby: On the Complexity of Samples for Learning. COCOON 2004: 198-209 |
| 2003 | ||
| 10 | EE | Joel Ratsaby: A Stochastic Gradient Descent Algorithm for Structural Risk Minimisation. ALT 2003: 205-220 |
| 9 | EE | Joel Ratsaby: On learning multicategory classification with sample queries. Inf. Comput. 185(2): 298-327 (2003) |
| 1999 | ||
| 8 | Joel Ratsaby, Vitaly Maiorov: On the Learnability of Rich Function Classes. J. Comput. Syst. Sci. 58(1): 183-192 (1999) | |
| 1998 | ||
| 7 | EE | 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) |
| 6 | EE | Joel Ratsaby: Incremental Learning With Sample Queries. IEEE Trans. Pattern Anal. Mach. Intell. 20(8): 883-888 (1998) |
| 1997 | ||
| 5 | Joel Ratsaby, Vitaly Maiorov: Generalization of the PAC-Model for Learning with Partial Information. EuroCOLT 1997: 51-65 | |
| 4 | Joel Ratsaby: An Incremental Nearest Neighbor Algorithm with Queries. NIPS 1997 | |
| 3 | EE | Joel Ratsaby, Vitaly Maiorov: On the Value of Partial Information for Learning from Examples. J. Complexity 13(4): 509-543 (1997) |
| 1996 | ||
| 2 | EE | Joel Ratsaby, Ron Meir, Vitaly Maiorov: Towards Robust Model Selection Using Estimation and Approximation Error Bounds. COLT 1996: 57-67 |
| 1995 | ||
| 1 | EE | Joel Ratsaby, Santosh S. Venkatesh: Learning from a Mixture of Labeled and Unlabeled Examples with Parametric Side Information. COLT 1995: 412-417 |
| 1 | J. Chaskalovic | [18] |
| 2 | Vitaly Maiorov | [2] [3] [5] [7] [8] |
| 3 | Ron Meir (Ronny Meir) | [2] |
| 4 | Santosh S. Venkatesh | [1] |
| 5 | Bernard Ycart | [14] |