The SCEAS System
| |||||||

## Search the dblp DataBase
Joel Ratsaby:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Joel Ratsaby
**A Stochastic Gradient Descent Algorithm for Structural Risk Minimisation.**[Citation Graph (0, 0)][DBLP] ALT, 2003, pp:205-220 [Conf] - Joel Ratsaby
**On the Complexity of Samples for Learning.**[Citation Graph (0, 0)][DBLP] COCOON, 2004, pp:198-209 [Conf] - Joel Ratsaby
**On the Combinatorial Representation of Information.**[Citation Graph (0, 0)][DBLP] COCOON, 2006, pp:479-488 [Conf] - Joel Ratsaby, Ron Meir, Vitaly Maiorov
**Towards Robust Model Selection Using Estimation and Approximation Error Bounds.**[Citation Graph (0, 0)][DBLP] COLT, 1996, pp:57-67 [Conf] - Joel Ratsaby, Santosh S. Venkatesh
**Learning from a Mixture of Labeled and Unlabeled Examples with Parametric Side Information.**[Citation Graph (0, 0)][DBLP] COLT, 1995, pp:412-417 [Conf] - Joel Ratsaby, Vitaly Maiorov
**Generalization of the PAC-Model for Learning with Partial Information.**[Citation Graph (0, 0)][DBLP] EuroCOLT, 1997, pp:51-65 [Conf] - Joel Ratsaby
**An Incremental Nearest Neighbor Algorithm with Queries.**[Citation Graph (0, 0)][DBLP] NIPS, 1997, pp:- [Conf] - Vitaly Maiorov, Joel Ratsaby
**The Degree of Approximation of Sets in Euclidean Space Using Sets with Bounded Vapnik-Chervonenkis Dimension.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1998, v:86, n:1, pp:81-93 [Journal] - Joel Ratsaby
**On learning multicategory classification with sample queries.**[Citation Graph (0, 0)][DBLP] Inf. Comput., 2003, v:185, n:2, pp:298-327 [Journal] - Joel Ratsaby, Vitaly Maiorov
**On the Value of Partial Information for Learning from Examples.**[Citation Graph (0, 0)][DBLP] J. Complexity, 1997, v:13, n:4, pp:509-543 [Journal] - Joel Ratsaby, Vitaly Maiorov
**On the Learnability of Rich Function Classes.**[Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 1999, v:58, n:1, pp:183-192 [Journal] - Joel Ratsaby
**Incremental Learning With Sample Queries.**[Citation Graph (0, 0)][DBLP] IEEE Trans. Pattern Anal. Mach. Intell., 1998, v:20, n:8, pp:883-888 [Journal] - Joel Ratsaby
**Complexity of hyperconcepts.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2006, v:363, n:1, pp:2-10 [Journal] - Joel Ratsaby
**Information Efficiency.**[Citation Graph (0, 0)][DBLP] SOFSEM (1), 2007, pp:475-487 [Conf] **On the complexity of binary samples.**[Citation Graph (, )][DBLP]**Information Width**[Citation Graph (, )][DBLP]**On the Complexity of Binary Samples**[Citation Graph (, )][DBLP]**An algorithmic complexity interpretation of Lin's third law of information theory**[Citation Graph (, )][DBLP]**Algorithmic complexity and randomness in elastic solids**[Citation Graph (, )][DBLP]**How random are a learner's mistakes?**[Citation Graph (, )][DBLP]**Combinatorial information distance**[Citation Graph (, )][DBLP]**Learning, complexity and information density**[Citation Graph (, )][DBLP]**Random scattering of bits by prediction**[Citation Graph (, )][DBLP]**Prediction by Compression**[Citation Graph (, )][DBLP]**On the complexity of constrained VC-classes.**[Citation Graph (, )][DBLP]**Constrained versions of Sauer's lemma.**[Citation Graph (, )][DBLP]**VC-Dimensions of Random Function Classes.**[Citation Graph (, )][DBLP]
Search in 0.003secs, Finished in 0.004secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |