The SCEAS System
Navigation Menu

Search the dblp DataBase


Joel Ratsaby: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Joel Ratsaby
    A Stochastic Gradient Descent Algorithm for Structural Risk Minimisation. [Citation Graph (0, 0)][DBLP]
    ALT, 2003, pp:205-220 [Conf]
  2. Joel Ratsaby
    On the Complexity of Samples for Learning. [Citation Graph (0, 0)][DBLP]
    COCOON, 2004, pp:198-209 [Conf]
  3. Joel Ratsaby
    On the Combinatorial Representation of Information. [Citation Graph (0, 0)][DBLP]
    COCOON, 2006, pp:479-488 [Conf]
  4. 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]
  5. 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]
  6. 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]
  7. Joel Ratsaby
    An Incremental Nearest Neighbor Algorithm with Queries. [Citation Graph (0, 0)][DBLP]
    NIPS, 1997, pp:- [Conf]
  8. 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]
  9. 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]
  10. 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]
  11. 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]
  12. 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]
  13. Joel Ratsaby
    Complexity of hyperconcepts. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:363, n:1, pp:2-10 [Journal]
  14. Joel Ratsaby
    Information Efficiency. [Citation Graph (0, 0)][DBLP]
    SOFSEM (1), 2007, pp:475-487 [Conf]

  15. On the complexity of binary samples. [Citation Graph (, )][DBLP]

  16. Information Width [Citation Graph (, )][DBLP]

  17. On the Complexity of Binary Samples [Citation Graph (, )][DBLP]

  18. An algorithmic complexity interpretation of Lin's third law of information theory [Citation Graph (, )][DBLP]

  19. Algorithmic complexity and randomness in elastic solids [Citation Graph (, )][DBLP]

  20. How random are a learner's mistakes? [Citation Graph (, )][DBLP]

  21. Combinatorial information distance [Citation Graph (, )][DBLP]

  22. Learning, complexity and information density [Citation Graph (, )][DBLP]

  23. Random scattering of bits by prediction [Citation Graph (, )][DBLP]

  24. Prediction by Compression [Citation Graph (, )][DBLP]

  25. On the complexity of constrained VC-classes. [Citation Graph (, )][DBLP]

  26. Constrained versions of Sauer's lemma. [Citation Graph (, )][DBLP]

  27. VC-Dimensions of Random Function Classes. [Citation Graph (, )][DBLP]

Search in 0.003secs, Finished in 0.004secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002