Computational learning theoryAUER, P; MAASS, W.Algorithmica. 1998, Vol 22, Num 1-2, issn 0178-4617, 231 p.Serial Issue

Computational Learning TheoryFISCHER, Paul; SIMON, Hans; SMITH, Carl et al.Theoretical computer science. 2002, Vol 284, Num 1, issn 0304-3975, 198 p.Conference Proceedings

Annual Workshop on Computational Learning Theory (COLT) 1994Journal of computer and system sciences (Print). 1996, Vol 52, Num 3, pp 393-492, issn 0022-0000Conference Proceedings

Computational learning theory (Nordkirchen, 29-31 March 1999)Fischer, Paul; Simon, Hans Ulrich.Lecture notes in computer science. 1999, issn 0302-9743, isbn 3-540-65701-0, X, 299 p, isbn 3-540-65701-0Conference Proceedings

A good oracle is hard to beatCENZER, D. A; MOSER, W. R.Algorithmica. 1998, Vol 22, Num 1-2, pp 18-34, issn 0178-4617Article

On bayes methods for on-line boolean predictionCESA-BIANCHI, N; HELMBOLD, D. P; PANIZZA, S et al.Algorithmica. 1998, Vol 22, Num 1-2, pp 112-137, issn 0178-4617Article

Agnostic boostingBEN-DAVID, Shai; LONG, Philip M; MANSOUR, Yishay et al.Lecture notes in computer science. 2001, pp 507-516, issn 0302-9743, isbn 3-540-42343-5Conference Paper

Learning matrix functions over ringsBSHOUTY, N. H; TAMON, C; WILSON, D. K et al.Algorithmica. 1998, Vol 22, Num 1-2, pp 91-111, issn 0178-4617Article

Classification accuracy based on observed marginSHAWE-TAYLOR, J.Algorithmica. 1998, Vol 22, Num 1-2, pp 157-172, issn 0178-4617Article

Mind change complexity of learning logic programsJAIN, Sanjay; SHARMA, Arun.Theoretical computer science. 2002, Vol 284, Num 1, pp 143-160, issn 0304-3975Conference Paper

On the rate of convergence of error estimates for the partitioning classification rulePINTER, Marta.Theoretical computer science. 2002, Vol 284, Num 1, pp 181-196, issn 0304-3975Conference Paper

Can finite samples detect singularities of real-valued functions?BEN-DAVID, S.Algorithmica. 1998, Vol 22, Num 1-2, pp 3-17, issn 0178-4617Article

A geometric approach to leveraging weak learnersDUFF, Nigel; HELMBOLD, David.Theoretical computer science. 2002, Vol 284, Num 1, pp 67-108, issn 0304-3975Conference Paper

Avoiding coding tricks by hyperrobust learningOTT, Matthias; STEPHAN, Frank.Theoretical computer science. 2002, Vol 284, Num 1, pp 161-180, issn 0304-3975Conference Paper

Query by committee, linear separation and random walksFINE, Shai; GILAD-BACHRACH, Ran; SHAMIR, Eli et al.Theoretical computer science. 2002, Vol 284, Num 1, pp 25-51, issn 0304-3975Conference Paper

Hardness results for neural network approximation problemsBARTLETTA, Peter L; BEN-DAVID, Shai.Theoretical computer science. 2002, Vol 284, Num 1, pp 53-66, issn 0304-3975Conference Paper

Lower bounds for the rate of convergence in nonparametric pattern recognitionANTOS, Andras.Theoretical computer science. 2002, Vol 284, Num 1, pp 3-24, issn 0304-3975Conference Paper

Learning additive models online with fast evaluating kernelsHERBSTER, Mark.Lecture notes in computer science. 2001, pp 444-460, issn 0302-9743, isbn 3-540-42343-5Conference Paper

Bounds on sample size for policy evaluation in Markov environmentsPESHKIN, Leonid; MUKHERJEE, Sayan.Lecture notes in computer science. 2001, pp 616-629, issn 0302-9743, isbn 3-540-42343-5Conference Paper

On using extended statistical queries to avoid membership queriesBSHOUTY, Nader H; FELDMAN, Vitaly.Lecture notes in computer science. 2001, pp 529-545, issn 0302-9743, isbn 3-540-42343-5Conference Paper

Smooth boosting and learning with malicious noiseSERVEDIO, Rocco A.Lecture notes in computer science. 2001, pp 473-489, issn 0302-9743, isbn 3-540-42343-5Conference Paper

When can two unsupervised learners achieve PAC separation?GOLDBERG, Paul W.Lecture notes in computer science. 2001, pp 303-319, issn 0302-9743, isbn 3-540-42343-5Conference Paper

Mind change complexity of learning logic programsJAIN, S; SHARMA, A.Lecture notes in computer science. 1999, pp 198-213, issn 0302-9743, isbn 3-540-65701-0Conference Paper

Learning range restricted Horn expressionsKHARDON, R.Lecture notes in computer science. 1999, pp 111-125, issn 0302-9743, isbn 3-540-65701-0Conference Paper

Direct and indirect algorithms for on-line learning of disjunctionsHELMBOLD, D. P; PANIZZA, S; WARMUTH, M. K et al.Lecture notes in computer science. 1999, pp 138-152, issn 0302-9743, isbn 3-540-65701-0Conference Paper