J. Ratsaby. A constrained version of Sauer's lemma. In Algorithms, Trees Combinatorics and Probabilities, volume III of Mathematics and Computer Science, pages 543--551. Birkhauser Verlag, http://www.bgu.ac.il/ ~ ratsaby/Publications/PDF/RN-03-13.pdf, 2004. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Complexity of VC-classes of sequences with long repetitive - Runs Joel Ratsaby Self-citation (Ratsaby) (Correct)
No context found.
J. Ratsaby. A constrained version of Sauer's lemma. In Algorithms, Trees Combinatorics and Probabilities, volume III of Mathematics and Computer Science, pages 543--551. Birkhauser Verlag, http://www.bgu.ac.il/ ~ ratsaby/Publications/PDF/RN-03-13.pdf, 2004.
On the Complexity of Good Samples for Learning - Joel Ratsaby Department Self-citation (Ratsaby) (Correct)
No context found.
J. Ratsaby. A constrained version of sauer's lemma. In Third Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities, Vienna, Austria, September 2004 (MathInfo 2004), Proceedings. Birkhuser, 2004.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC