The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Ayumi Shinohara
    String Pattern Discovery. [Citation Graph (0, 0)][DBLP]
    ALT, 2004, pp:1-13 [Conf]
  2. Nicolò Cesa-Bianchi
    Applications of Regularized Least Squares to Classification Problems. [Citation Graph (0, 0)][DBLP]
    ALT, 2004, pp:14-18 [Conf]
  3. Luc De Raedt, Kristian Kersting
    Probabilistic Inductive Logic Programming. [Citation Graph (0, 0)][DBLP]
    ALT, 2004, pp:19-36 [Conf]
  4. Mikko Koivisto, Teemu Kivioja, Heikki Mannila, Pasi Rastas, Esko Ukkonen
    Hidden Markov Modelling Techniques for Haplotype Analysis. [Citation Graph (0, 0)][DBLP]
    ALT, 2004, pp:37-52 [Conf]
  5. Pedro Domingos
    Learning, Logic, and Probability: A Unified View. [Citation Graph (0, 0)][DBLP]
    ALT, 2004, pp:53- [Conf]
  6. Sanjay Jain, Efim B. Kinber
    Learning Languages from Positive Data and Negative Counterexamples. [Citation Graph (0, 0)][DBLP]
    ALT, 2004, pp:54-68 [Conf]
  7. M. R. K. Krishna Rao
    Inductive Inference of Term Rewriting Systems from Positive Data. [Citation Graph (0, 0)][DBLP]
    ALT, 2004, pp:69-82 [Conf]
  8. Eric Martin, Arun Sharma, Frank Stephan
    On the Data Consumption Benefits of Accepting Increased Uncertainty. [Citation Graph (0, 0)][DBLP]
    ALT, 2004, pp:83-98 [Conf]
  9. Steffen Lange, Sandra Zilles
    Comparison of Query Learning and Gold-Style Learning in Dependence of the Hypothesis Space. [Citation Graph (0, 0)][DBLP]
    ALT, 2004, pp:99-113 [Conf]
  10. Kohei Hatano, Osamu Watanabe
    Learning r-of-k Functions by Boosting. [Citation Graph (0, 0)][DBLP]
    ALT, 2004, pp:114-126 [Conf]
  11. Eiji Takimoto, Syuhei Koya, Akira Maruoka
    Boosting Based on Divide and Merge. [Citation Graph (0, 0)][DBLP]
    ALT, 2004, pp:127-141 [Conf]
  12. Akinobu Miyata, Jun Tarui, Etsuji Tomita
    Learning Boolean Functions in AC0 on Attribute and Classification Noise. [Citation Graph (0, 0)][DBLP]
    ALT, 2004, pp:142-155 [Conf]
  13. Amos Fiat, Dmitry Pechyony
    Decision Trees: More Theoretical Justification for Practical Algorithms. [Citation Graph (0, 0)][DBLP]
    ALT, 2004, pp:156-170 [Conf]
  14. Daniil Ryabko
    Application of Classical Nonparametric Predictors to Learning Conditionally I.I.D. Data. [Citation Graph (0, 0)][DBLP]
    ALT, 2004, pp:171-180 [Conf]
  15. Amiran Ambroladze, John Shawe-Taylor
    Complexity of Pattern Classes and Lipschitz Property. [Citation Graph (0, 0)][DBLP]
    ALT, 2004, pp:181-193 [Conf]
  16. Maria-Florina Balcan, Avrim Blum, Santosh Vempala
    On Kernels, Margins, and Low-Dimensional Mappings. [Citation Graph (0, 0)][DBLP]
    ALT, 2004, pp:194-205 [Conf]
  17. Kazuho Watanabe, Sumio Watanabe
    Estimation of the Data Region Using Extreme-Value Distributions. [Citation Graph (0, 0)][DBLP]
    ALT, 2004, pp:206-220 [Conf]
  18. Victor Maslov, Vladimir V'yugin
    Maximum Entropy Principle in Non-ordered Setting. [Citation Graph (0, 0)][DBLP]
    ALT, 2004, pp:221-233 [Conf]
  19. Marcus Hutter, Andrej Muchnik
    Universal Convergence of Semimeasures on Individual Random Sequences. [Citation Graph (0, 0)][DBLP]
    ALT, 2004, pp:234-248 [Conf]
  20. Yuri Kalnishkan, Vladimir Vovk, Michael V. Vyugin
    A Criterion for the Existence of Predictive Complexity for Binary Games. [Citation Graph (0, 0)][DBLP]
    ALT, 2004, pp:249-263 [Conf]
  21. Chamy Allenberg-Neeman, Benny Neeman
    Full Information Game with Gains and Losses. [Citation Graph (0, 0)][DBLP]
    ALT, 2004, pp:264-278 [Conf]
  22. Marcus Hutter, Jan Poland
    Prediction with Expert Advice by Following the Perturbed Leader for General Weights. [Citation Graph (0, 0)][DBLP]
    ALT, 2004, pp:279-293 [Conf]
  23. Jan Poland, Marcus Hutter
    On the Convergence Speed of MDL Predictions for Bernoulli Sequences. [Citation Graph (0, 0)][DBLP]
    ALT, 2004, pp:294-308 [Conf]
  24. Mark Herbster
    Relative Loss Bounds and Polynomial-Time Predictions for the k-lms-net Algorithm. [Citation Graph (0, 0)][DBLP]
    ALT, 2004, pp:309-323 [Conf]
  25. Hans-Ulrich Simon
    On the Complexity of Working Set Selection. [Citation Graph (0, 0)][DBLP]
    ALT, 2004, pp:324-337 [Conf]
  26. Nikolas List
    Convergence of a Generalized Gradient Selection Approach for the Decomposition Method. [Citation Graph (0, 0)][DBLP]
    ALT, 2004, pp:338-349 [Conf]
  27. Keisuke Yamazaki, Sumio Watanabe
    Newton Diagram and Stochastic Complexity in Mixture of Binomial Distributions. [Citation Graph (0, 0)][DBLP]
    ALT, 2004, pp:350-364 [Conf]
  28. Andrei A. Bulatov, Hubie Chen, Víctor Dalmau
    Learnability of Relatively Quantified Generalized Formulas. [Citation Graph (0, 0)][DBLP]
    ALT, 2004, pp:365-379 [Conf]
  29. Yasuhito Mukouchi, Masako Sato
    Learning Languages Generated by Elementary Formal Systems and Its Application to SH Languages. [Citation Graph (0, 0)][DBLP]
    ALT, 2004, pp:380-394 [Conf]
  30. Judy Goldsmith, Robert H. Sloan, Balázs Szörényi, György Turán
    New Revision Algorithms. [Citation Graph (0, 0)][DBLP]
    ALT, 2004, pp:395-409 [Conf]
  31. Marta Arias, Roni Khardon
    The Subsumption Lattice and Query Learning. [Citation Graph (0, 0)][DBLP]
    ALT, 2004, pp:410-424 [Conf]
  32. Satoshi Matsumoto, Takayoshi Shoudai
    Learning of Ordered Tree Languages with Height-Bounded Variables Using Queries. [Citation Graph (0, 0)][DBLP]
    ALT, 2004, pp:425-439 [Conf]
  33. Jérôme Besombes, Jean-Yves Marion
    Learning Tree Languages from Positive Examples and Membership Queries. [Citation Graph (0, 0)][DBLP]
    ALT, 2004, pp:440-453 [Conf]
  34. Ana Iglesias, Paloma Martínez, Ricardo Aler, Fernando Fernández
    Learning Content Sequencing in an Educational Environment According to Student Needs. [Citation Graph (0, 0)][DBLP]
    ALT, 2004, pp:454-463 [Conf]
  35. Toshiyuki Tanaka
    Statistical Learning in Digital Wireless Communications. [Citation Graph (0, 0)][DBLP]
    ALT, 2004, pp:464-478 [Conf]
  36. Yoshiyuki Kabashima, Shinsuke Uda
    A BP-Based Algorithm for Performing Bayesian Inference in Large Perceptron-Type Networks. [Citation Graph (0, 0)][DBLP]
    ALT, 2004, pp:479-493 [Conf]
  37. Manfred Opper, Ole Winther
    Approximate Inference in Probabilistic Models. [Citation Graph (0, 0)][DBLP]
    ALT, 2004, pp:494-504 [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