The SCEAS System
Navigation Menu

Conferences in DBLP

Algorithmic Learning Theory (ALT) (alt)
1997 (conf/alt/1997)

  1. Manuel Blum
    Program Error Detection/Correction: Turning PAC Learning into PERFECT Learning (Abstract). [Citation Graph (0, 0)][DBLP]
    ALT, 1997, pp:1- [Conf]
  2. Andris Ambainis, Kalvis Apsitis, Rusins Freivalds, William I. Gasarch, Carl H. Smith
    Team Learning as a Game. [Citation Graph (0, 0)][DBLP]
    ALT, 1997, pp:2-17 [Conf]
  3. Eiju Hirowatari, Setsuo Arikawa
    Inferability of Recursive Real-Valued Functions. [Citation Graph (0, 0)][DBLP]
    ALT, 1997, pp:18-31 [Conf]
  4. Sanjay Jain, Steffen Lange, Jochen Nessel
    Learning of R.E. Languages from Good Examples. [Citation Graph (0, 0)][DBLP]
    ALT, 1997, pp:32-47 [Conf]
  5. Satoshi Kobayashi, Takashi Yokomori
    Identifiability of Subspaces and Homomorphic Images of Zero-Reversible Languages. [Citation Graph (0, 0)][DBLP]
    ALT, 1997, pp:48-61 [Conf]
  6. Leonard Pitt
    On Exploiting Knowledge and Concept Use in Learning Theory. [Citation Graph (0, 0)][DBLP]
    ALT, 1997, pp:62-84 [Conf]
  7. Carlos Domingo, Tatsuie Tsukiji, Osamu Watanabe
    Partial Occam's Razor and Its Applications. [Citation Graph (0, 0)][DBLP]
    ALT, 1997, pp:85-99 [Conf]
  8. Meera Sitharam, Timothy Straney
    Deranomized Learning of Boolean Functions. [Citation Graph (0, 0)][DBLP]
    ALT, 1997, pp:100-115 [Conf]
  9. Rajesh Parekh, Vasant Honavar
    Learning DFA from Simple Examples. [Citation Graph (0, 0)][DBLP]
    ALT, 1997, pp:116-131 [Conf]
  10. François Denis, Rémi Gilleron
    PAC Learning under Helpful Distributions. [Citation Graph (0, 0)][DBLP]
    ALT, 1997, pp:132-145 [Conf]
  11. Hongzhu Qiao, Nageswara S. V. Rao, Vladimir Protopopescu
    PAC Learning Using Nadaraya-Watson Estimator Based on Orthonormal Systems. [Citation Graph (0, 0)][DBLP]
    ALT, 1997, pp:146-160 [Conf]
  12. Endre Boros, Toshihide Ibaraki, Kazuhisa Makino
    Monotone Extensions of Boolean Data Sets. [Citation Graph (0, 0)][DBLP]
    ALT, 1997, pp:161-175 [Conf]
  13. Masahiko Sato
    Classical Brouwer-Heyting-Kolmogorov Interpretation. [Citation Graph (0, 0)][DBLP]
    ALT, 1997, pp:176-196 [Conf]
  14. Yasuhito Mukouchi
    Inferring a System from Examples with Time Passage. [Citation Graph (0, 0)][DBLP]
    ALT, 1997, pp:197-211 [Conf]
  15. Satoshi Matsumoto, Yukiko Hayashi, Takayoshi Shoudai
    Polynomial Time Inductive Inference of Regular Term Tree Languages from Positive Data. [Citation Graph (0, 0)][DBLP]
    ALT, 1997, pp:212-227 [Conf]
  16. John Case, Sanjay Jain, Arun Sharma
    Synthesizing Noise-Tolerant Language Learners. [Citation Graph (0, 0)][DBLP]
    ALT, 1997, pp:228-243 [Conf]
  17. Andris Ambainis, Kalvis Apsitis, Cristian Calude, Rusins Freivalds, Marek Karpinski, Tomas Larfeldt, Iveta Sala, Juris Smotrovs
    Effects of Kolmogorov Complexity Present in Inductive Inference as Well. [Citation Graph (0, 0)][DBLP]
    ALT, 1997, pp:244-259 [Conf]
  18. Thomas Erlebach, Peter Rossmanith, Hans Stadtherr, Angelika Steger, Thomas Zeugmann
    Learning One-Variable Pattern Languages Very Efficiently on Average, in Parallel, and by Asking Queries. [Citation Graph (0, 0)][DBLP]
    ALT, 1997, pp:260-276 [Conf]
  19. Johannes Köbler, Wolfgang Lindner
    Oracles in Sigmap2 are Sufficient for Exact Learning. [Citation Graph (0, 0)][DBLP]
    ALT, 1997, pp:277-290 [Conf]
  20. Vikraman Arvind, N. V. Vinodchandran
    Exact Learning via Teaching Assistants (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ALT, 1997, pp:291-306 [Conf]
  21. Atsuyoshi Nakamura
    An Efficient Exact Learning Algorithm for Ordered Binary Decision Diagrams. [Citation Graph (0, 0)][DBLP]
    ALT, 1997, pp:307-322 [Conf]
  22. V. G. Vovk
    Probability Theory for the Brier Game. [Citation Graph (0, 0)][DBLP]
    ALT, 1997, pp:323-338 [Conf]
  23. Xiaolong Zhang, Masayuki Numao
    Learning and Revising Theories in Noisy Domains. [Citation Graph (0, 0)][DBLP]
    ALT, 1997, pp:339-351 [Conf]
  24. Leonid Gurvits
    A Note on a Scale-Sensitive Dimension of Linear Bounded Functionals in Banach Spaces. [Citation Graph (0, 0)][DBLP]
    ALT, 1997, pp:352-363 [Conf]
  25. Wolfgang Maass
    On the Relevance of Time in Neural Computation and Learning. [Citation Graph (0, 0)][DBLP]
    ALT, 1997, pp:364-384 [Conf]
  26. Eiji Takimoto, Ken'ichi Hirai, Akira Maruoka
    A Simple Algorithm for Predicting Nearly as Well as the Best Pruning Labeled with the Best Prediction Values of a Decision Tree. [Citation Graph (0, 0)][DBLP]
    ALT, 1997, pp:385-400 [Conf]
  27. Stephen Kwek
    Learning Disjunctions of Features. [Citation Graph (0, 0)][DBLP]
    ALT, 1997, pp:401-415 [Conf]
  28. Hiroshi Sakamoto
    Learning Simple Deterministic Finite-Memory Automata. [Citation Graph (0, 0)][DBLP]
    ALT, 1997, pp:416-431 [Conf]
  29. Hiroki Arimura
    Learning Acyclic First-Order Horn Sentences from Entailment. [Citation Graph (0, 0)][DBLP]
    ALT, 1997, pp:432-445 [Conf]
  30. Tibor Hegedüs, Piotr Indyk
    On Learning Disjunctions of Zero-One Treshold Functions with Queries. [Citation Graph (0, 0)][DBLP]
    ALT, 1997, pp:446-460 [Conf]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
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 asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002