Home Page





Editorial Board



Open Source Software



RSS Feed

JMLR Workshop and Conference Proceedings
Volume 21: ICGI 2012

Proceedings of the Eleventh International Conference on Grammatical Inference
September 5-8, 2012, University of Maryland, College Park, United States

Editors: Jeffrey Heinz, Colin de la Higuera, and Tim Oates
Jeffrey Heinz, Colin de la Higuera, and Tim Oates ; 21:1-3, 2012.

Learning and Testing the Bounded Retransmission Protocol
Fides Aarts, Harco Kuppens, Jan Tretmans, Frits Vaandrager and Sicco Verwer ; 21:4-18, 2012.
[abs] [pdf]

Actively Learning Probabilistic Subsequential Transducers
Hasan Ibne Akram, Colin de La Higuera and Claudia Eckert ; 21:19-33, 2012.
[abs] [pdf]

Bootstrapping and Learning PDFA in Data Streams
Borja Balle, Jorge Castro and Ricard Gavaldà ; 21:34-48, 2012.
[abs] [pdf]

Speeding Up Syntactic Learning Using Contextual Information
Leonor Becerra Bonache, Elisa Fromont, Amaury Habrard, Michaël Perrot and Marc Sebban ; 21:49-53, 2012.
[abs] [pdf]

Clearing Restarting Automata and Grammatical Inference
Peter Černo ; 21:54-68, 2012.
[abs] [pdf]

Integrating Grammatical Inference into Robotic Planning
Jane Chandlee, Jie Fu, Konstantinos Karydis, Cesar Koirala, Jeffrey Heinz and Herbert Tanner ; 21:69-83, 2012.
[abs] [pdf]

Beyond Semilinearity: Distributional Learning of Parallel Multiple Context-free Grammars
Alexander Clark and Ryo Yoshinaka ; 21:84-96, 2012.
[abs] [pdf]

Locally Substitutable Languages for Enhanced Inductive Leaps
François Coste, Gaëlle Garet and Jacques Nicolas ; 21:97-111, 2012.
[abs] [pdf]

Grammar Induction: Beyond Local Search
Jason Eisner ; 21:112-113, 2012.
[abs] [pdf]

Learning Substitutable Binary Plane Graph Grammars
Rémi Eyraud, Jean-Christophe Janodet and Tim Oates ; 21:114-128, 2012.
[abs] [pdf]

Learning Tree Adjoining Grammars from Structures and Strings
Christophe Costa Florêncio ; 21:129-132, 2012.
[abs] [pdf]

Improving Model Inference of Black Box Components having Large Input Test Set
Muhammad Naeem Irfan, Roland Groz and Catherine Oriat ; 21:133-138, 2012.
[abs] [pdf]

Learning of Bi-ω Languages from Factors
M. Jayasrirani, M. H. Begam, D. G. Thomas D.G and J. D. Emerald ; 21:139-144, 2012.
[abs] [pdf]

Inducing Partially Observable Markov Decision Processes
Michael L. Littman ; 21:145-148, 2012.
[abs] [pdf]

Inference of k-Testable Directed Acyclic Graph Languages
Damián López, Jorge Calera-Rubio and Javier Gallego-Sánchez ; 21:149-163, 2012.
[abs] [pdf]

A Lattice of Sets of Alignments Built on the Common Subwords in a Finite Language
Laurent Miclet, Nelly Barbot and Baptiste Jeudy ; 21:164-176, 2012.
[abs] [pdf]

Estimation of Generating Processes of Strings Represented with Patterns and Refinements
Keisuke Otaki and Akihiro Yamamoto ; 21:177-182, 2012.
[abs] [pdf]

Applying Grammar Inference To Identify Generalized Patterns of Facial Expressions of Pain
Ute Schmid, Michael Siebers, Dominik Seuß, Miriam Kunz and Stefan Lautenbacher ; 21:183-188, 2012.
[abs] [pdf]

Bootstrapping Dependency Grammar Inducers from Incomplete Sentence Fragments via Austere Models
Valentin I. Spitkovsky, Hiyan Alshawi and Daniel Jurafsky ; 21:189-194, 2012.
[abs] [pdf]

Active Automata Learning: From DFAs to Interface Programs and Beyond
Bernhard Steffen and Falk Howar and Malte Isberner ; 21:195-209, 2012.
[abs] [pdf]

Fuzzy Grammar-based Prediction of Amyloidogenic Regions
Olgierd Unold ; 21:210-219, 2012.
[abs] [pdf]

Learning Interpretations Using Sequence Classification
Menno van Zaanen and Janneke van de Loo ; 21:220-223, 2012.
[abs] [pdf]

Model Merging versus Model Splitting Context-Free Grammar Induction
Menno van Zaanen and Nanne van Noord ; 21:224-236, 2012.
[abs] [pdf]

Induction of Non-Deterministic Finite Automata on Supercomputers
Wojciech Wieczorek ; 21:237-242, 2012.
[abs] [pdf]

Pautomac Challenge

Results of the PAutomaC Probabilistic Automaton Learning Competition
Sicco Verwer, Rémi Eyraud, and Colin de la Higuera ; 21:243-248, 2012.
[abs] [pdf]

Treba: Efficient Numerically Stable EM for PFA
Mans Hulden ; 21:249-253, 2012.
[abs] [pdf]

Simple Variable Length N-grams for Probabilistic Automata Learning
Fabio N. Kepler, Sergio L. S. Mergen, and Cleo Z. Billa ; 21:254-258, 2012.
[abs] [pdf]

Marginalizing Out Transition Probabilities for Several Subclasses of PFAs
Chihiro Shibata and Ryo Yoshinaka ; 21:259-263, 2012.
[abs] [pdf]

Page last modified on Wed Aug 15 10:31:26 JST 2012 .

webmasterjmlr.org Copyright@JMLR 2012. All rights reserved.