Author： Freund Y. Kearns M. Ron D. Rubinfeld R. Schapire R.E. Sellie L.
Publisher： Academic Press
ISSN： 0890-5401
Source： Information and Computation, Vol.138, Iss.1, 1997-10, pp. : 23-48
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
Exploiting Random Walks for Learning
By Bartlett P.L. Fischer P. Höffgen K-U.
Information and Computation, Vol. 176, Iss. 2, 2002-08 ,pp. :
Access to resources
Recommend
Deterministic random walks on finite graphs
RANDOM STRUCTURES AND ALGORITHMS, Vol. 46, Iss. 4, 2015-07 ,pp. :
Efficient fast learning automata
By Obaidat M.S. Papadimitriou G.I. Pomportsis A.S.
Information Sciences, Vol. 157, Iss. unknown, 2003-12 ,pp. :
Characters and Random Walks on Finite Classical Groups
By Gluck D.
Advances in Mathematics, Vol. 129, Iss. 1, 1997-07 ,pp. :
On the Exit of One Class of Random Walks from an Interval
By Husak D.
Ukrainian Mathematical Journal, Vol. 57, Iss. 9, 2005-09 ,pp. :