Google Books

Kearns, D. Ron, R. Rubinfeld, RE Schapire, and L. Sellie. Efficient Learning of Typical Finite Automata from Random Walks.

An Introduction to Computational Learning Theory - Seite 197
von Michael J. Kearns, Umesh Vazirani - 1994 - 222 Seiten
Eingeschränkte Leseprobe - Über dieses Buch

STACS 96: 13th Annual Symposium on Theoretical Aspects of Computer Science ...

Claude Puech, Rüdiger Reischuk - 1996 - 710 Seiten

...processes” Ann. Appl. Prob. 1, (1991), 62-87. [F&a193] Y. Freund, M. Kearns, D. Ron, R. Rubinfeld, RE Schapire and L. Sellie. “Efficient learning of typical finite automata from random walks”, 25th ACM Symposium on the Theory of Computing (1993), 315-324. [FJRST95] J. Friedman,A. Joux,Y. Roichman,J....

Eingeschränkte Leseprobe - Über dieses Buch