Ihre E-Mail wurde erfolgreich gesendet. Bitte prüfen Sie Ihren Maileingang.

Leider ist ein Fehler beim E-Mail-Versand aufgetreten. Bitte versuchen Sie es erneut.

Vorgang fortführen?

Exportieren
  • 1
    UID:
    almahu_BV019585295
    Umfang: XI, 289 S. : , Ill., graph. Darst. ; , 235 mm x 155 mm.
    ISBN: 3-540-23410-1
    Serie: Lecture Notes in Computer Science 3264 : Lecture notes in artificial intelligence
    Sprache: Englisch
    Schlagwort(e): Maschinelles Lernen ; Formale Grammatik ; Inferenz ; Konferenzschrift ; Konferenzschrift ; Konferenzschrift
    URL: Cover
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 2
    UID:
    kobvindex_ZLB13821373
    Umfang: XI, 289 Seiten , graph. Darst. , 24 cm
    ISBN: 3540234101
    Serie: Lecture notes in computer science
    Anmerkung: Literaturangaben , Text engl.
    Sprache: Englisch
    Schlagwort(e): Maschinelles Lernen ; Formale Grammatik ; Inferenz 〈Künstliche Intelligenz〉 ; Kongress ; Athen 〈2004〉 ; Kongress ; Konferenzschrift
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 3
    UID:
    gbv_749096632
    Umfang: Online-Ressource (XI, 291 p. Also available online) , digital
    Ausgabe: Reproduktion Springer eBook Collection. Computer Science
    ISBN: 9783540301950 , 3540234101 , 9783540234104
    Serie: Lecture Notes in Computer Science 3264
    Inhalt: This book constitutes the refereed proceedings of the 7th International Colloquium on Grammatical Inference, ICGI 2004, held in Athens, Greece in October 2004. The 20 revised full papers and 8 revised poster papers presented together with 3 invited contributions were carefully reviewed and selected from 45 submissions. The topics of the papers presented range from theoretical results of learning algorithms to innovative applications of grammatical inference and from learning several interesting classes of formal grammars to estimations of probabilistic grammars
    Anmerkung: Literaturangaben
    Weitere Ausg.: ISBN 9783540234104
    Weitere Ausg.: Erscheint auch als Druck-Ausgabe ISBN 9783662189726
    Weitere Ausg.: Erscheint auch als Druck-Ausgabe ISBN 9783540234104
    Sprache: Englisch
    URL: Volltext  (lizenzpflichtig)
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 4
    UID:
    almahu_9947920451302882
    Umfang: XII, 296 p. , online resource.
    ISBN: 9783540301950
    Serie: Lecture Notes in Computer Science, 3264
    Anmerkung: Invited Papers -- Learning and Mathematics -- Learning Finite-State Models for Machine Translation -- The Omphalos Context-Free Grammar Learning Competition -- Regular Papers -- Mutually Compatible and Incompatible Merges for the Search of the Smallest Consistent DFA -- Faster Gradient Descent Training of Hidden Markov Models, Using Individual Learning Rate Adaptation -- Learning Mild Context-Sensitiveness: Toward Understanding Children’s Language Learning -- Learnability of Pregroup Grammars -- A Markovian Approach to the Induction of Regular String Distributions -- Learning Node Selecting Tree Transducer from Completely Annotated Examples -- Identifying Clusters from Positive Data -- Introducing Domain and Typing Bias in Automata Inference -- Analogical Equations in Sequences: Definition and Resolution -- Representing Languages by Learnable Rewriting Systems -- A Divide-and-Conquer Approach to Acquire Syntactic Categories -- Grammatical Inference Using Suffix Trees -- Learning Stochastic Finite Automata -- Navigation Pattern Discovery Using Grammatical Inference -- A Corpus-Driven Context-Free Approximation of Head-Driven Phrase Structure Grammar -- Partial Learning Using Link Grammars Data -- eg-GRIDS: Context-Free Grammatical Inference from Positive Examples Using Genetic Search -- The Boisdale Algorithm – An Induction Method for a Subclass of Unification Grammar from Positive Data -- Learning Stochastic Deterministic Regular Languages -- Polynomial Time Identification of Strict Deterministic Restricted One-Counter Automata in Some Class from Positive Data -- Poster Papers -- Learning Syntax from Function Words -- Running FCRPNI in Efficient Time for Piecewise and Right Piecewise Testable Languages -- Extracting Minimum Length Document Type Definitions Is NP-Hard -- Learning Distinguishable Linear Grammars from Positive Data -- Extending Incremental Learning of Context Free Grammars in Synapse -- Identifying Left-Right Deterministic Linear Languages -- Efficient Learning of k-Reversible Context-Free Grammars from Positive Structural Examples -- An Analysis of Examples and a Search Space for PAC Learning of Simple Deterministic Languages with Membership Queries.
    In: Springer eBooks
    Weitere Ausg.: Printed edition: ISBN 9783540234104
    Sprache: Englisch
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 5
    UID:
    almahu_9948621575402882
    Umfang: XII, 296 p. , online resource.
    Ausgabe: 1st ed. 2004.
    ISBN: 9783540301950
    Serie: Lecture Notes in Artificial Intelligence ; 3264
    Anmerkung: Invited Papers -- Learning and Mathematics -- Learning Finite-State Models for Machine Translation -- The Omphalos Context-Free Grammar Learning Competition -- Regular Papers -- Mutually Compatible and Incompatible Merges for the Search of the Smallest Consistent DFA -- Faster Gradient Descent Training of Hidden Markov Models, Using Individual Learning Rate Adaptation -- Learning Mild Context-Sensitiveness: Toward Understanding Children's Language Learning -- Learnability of Pregroup Grammars -- A Markovian Approach to the Induction of Regular String Distributions -- Learning Node Selecting Tree Transducer from Completely Annotated Examples -- Identifying Clusters from Positive Data -- Introducing Domain and Typing Bias in Automata Inference -- Analogical Equations in Sequences: Definition and Resolution -- Representing Languages by Learnable Rewriting Systems -- A Divide-and-Conquer Approach to Acquire Syntactic Categories -- Grammatical Inference Using Suffix Trees -- Learning Stochastic Finite Automata -- Navigation Pattern Discovery Using Grammatical Inference -- A Corpus-Driven Context-Free Approximation of Head-Driven Phrase Structure Grammar -- Partial Learning Using Link Grammars Data -- eg-GRIDS: Context-Free Grammatical Inference from Positive Examples Using Genetic Search -- The Boisdale Algorithm - An Induction Method for a Subclass of Unification Grammar from Positive Data -- Learning Stochastic Deterministic Regular Languages -- Polynomial Time Identification of Strict Deterministic Restricted One-Counter Automata in Some Class from Positive Data -- Poster Papers -- Learning Syntax from Function Words -- Running FCRPNI in Efficient Time for Piecewise and Right Piecewise Testable Languages -- Extracting Minimum Length Document Type Definitions Is NP-Hard -- Learning Distinguishable Linear Grammars from Positive Data -- Extending Incremental Learning of Context Free Grammars in Synapse -- Identifying Left-Right Deterministic Linear Languages -- Efficient Learning of k-Reversible Context-Free Grammars from Positive Structural Examples -- An Analysis of Examples and a Search Space for PAC Learning of Simple Deterministic Languages with Membership Queries.
    In: Springer Nature eBook
    Weitere Ausg.: Printed edition: ISBN 9783662189726
    Weitere Ausg.: Printed edition: ISBN 9783540234104
    Sprache: Englisch
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
Meinten Sie 354023101?
Meinten Sie 354023411?
Meinten Sie 3540214011?
Schließen ⊗
Diese Webseite nutzt Cookies und das Analyse-Tool Matomo. Weitere Informationen finden Sie auf den KOBV Seiten zum Datenschutz