feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Book
    Book
    Mannheim u.a. : BI-Wiss.-Verl.
    UID:
    b3kat_BV009555985
    Format: 288 S. , graph. Darst.
    ISBN: 3411170115
    Series Statement: Aspekte komplexer Systeme 2
    Note: Zugl.: Karlsruhe, Univ., Diss., 1993 u.d.T.: Fernau, Henning: Varianten iterierter Funktionssysteme und Methoden der formalen Sprachen
    Language: German
    Subjects: Computer Science , Mathematics
    RVK:
    RVK:
    RVK:
    Keywords: Fraktal ; Formale Sprache ; Iteriertes Funktionensystem ; Hochschulschrift ; Hochschulschrift ; Lehrmittel
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    UID:
    b3kat_BV049357984
    Format: 1 Online-Ressource (xiii, 438 Seiten) , 111 Illustrationen, 46 in Farbe
    Edition: Corrected publication
    ISBN: 9783031435874
    Series Statement: Lecture notes in computer science 14292
    Additional Edition: Erscheint auch als Druck-Ausgabe ISBN 978-3-031-43586-7
    Additional Edition: Erscheint auch als Druck-Ausgabe ISBN 978-3-031-43588-1
    Language: English
    Subjects: Computer Science
    RVK:
    Keywords: Theoretische Informatik ; Konferenzschrift
    URL: Volltext  (URL des Erstveröffentlichers)
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    UID:
    b3kat_BV049594348
    Format: 1 Online-Ressource (xv, 502 Seiten) , 82 Illustrationen, 39 in Farbe
    ISBN: 9783031521133
    Series Statement: Lecture notes in computer science 14519
    Additional Edition: Erscheint auch als Druck-Ausgabe ISBN 978-3-031-52112-6
    Additional Edition: Erscheint auch als Druck-Ausgabe ISBN 978-3-031-52114-0
    Language: English
    Keywords: Theoretische Informatik ; Software Engineering ; World Wide Web ; Künstliche Intelligenz ; Software Engineering ; World Wide Web ; Künstliche Intelligenz ; Konferenzschrift
    URL: Volltext  (URL des Erstveröffentlichers)
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 4
    UID:
    b3kat_BV046791824
    Format: 1 Online-Ressource , Illustrationen, Diagramme
    ISBN: 9783030500269
    Series Statement: Lecture notes in computer science 12159
    Additional Edition: Erscheint auch als Druck-Ausgabe ISBN 978-3-030-50025-2
    Additional Edition: Erscheint auch als Druck-Ausgabe ISBN 978-3-030-50027-6
    Language: English
    Subjects: Computer Science
    RVK:
    Keywords: Diskrete Mathematik ; Datenstruktur ; Informationstheorie ; Theoretische Informatik ; Konferenzschrift
    URL: Volltext  (URL des Erstveröffentlichers)
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 5
    UID:
    b3kat_BV048250787
    Format: 1 Online-Ressource (xviii, 524 Seiten) , 112 Illustrationen, 48 in Farbe
    ISBN: 9783031066788
    Series Statement: Lecture notes in computer science 13270
    Additional Edition: Erscheint auch als Druck-Ausgabe ISBN 978-3-031-06677-1
    Additional Edition: Erscheint auch als Druck-Ausgabe ISBN 978-3-031-06679-5
    Language: English
    Subjects: Computer Science
    RVK:
    Keywords: Diskrete Mathematik ; Algorithmus ; Datenstruktur ; Computergrafik ; Kombinatorik ; Algorithmus ; Konferenzschrift
    URL: Volltext  (URL des Erstveröffentlichers)
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 6
    UID:
    b3kat_BV046797562
    Format: xi, 433 Seiten , Illustrationen, Diagramme
    ISBN: 9783030500252
    Series Statement: Lecture notes in computer science 12159
    Additional Edition: Erscheint auch als Online-Ausgabe ISBN 978-3-030-50026-9
    Language: English
    Subjects: Computer Science
    RVK:
    Keywords: Theoretische Informatik ; Diskrete Mathematik ; Datenstruktur ; Informationstheorie ; Konferenzschrift ; Konferenzschrift
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 7
    UID:
    gbv_1724273337
    Format: 1 Online-Ressource(XI, 433 p. 187 illus., 23 illus. in color.)
    Edition: 1st ed. 2020.
    ISBN: 9783030500269
    Series Statement: Theoretical Computer Science and General Issues 12159
    Content: Quantum Hashing and Fingerprinting for Quantum Cryptography and Computations -- Parameterized Analysis of Art Gallery and Terrain Guarding -- Central Positions in Social Networks -- Second-Order Finite Automata -- Isomorphic Distances Among Elections -- Tandem Duplications, Segmental Duplications and Deletions, and their Applications -- Faster 2-Disjoint-Shortest-Path Algorithm -- An Improvement to Chvátal and Thomassen's Upper Bound for Oriented Diameter -- The Normalized Algorithmic Information Distance Cannot be Approximated -- Definable Subsets of Polynomial-Time Algebraic Structures -- Families of Monotonic Trees: Combinatorial Enumeration and Asymptotics -- Nested Regular Expressions can be Compiled to Small Deterministic Nested Word Automata -- On Embeddability of Unit Disk Graphs onto Straight Lines.-On the Decision Tree Complexity of Threshold Functions -- Randomized and Symmetric Catalytic Computation -- On the Parameterized Complexity of the Expected Coverage Problem -- Computational Hardness of Multidimensional Subtraction Games -- Parameterized Complexity of Fair Feedback Vertex Set Problem -- The Power of Leibniz-like Functions as Oracles -- Optimal Skeleton Huffman Trees Revisited -- The Subtrace Order and Counting First-Order Logic -- Speedable left-c.e. Numbers -- The Complexity of Controlling Condorcet, Fallback, and k-Veto Elections by Replacing Candidates or Voters -- On the Transformation of LL(k)-linear Grammars to LL(1)-linear -- On Computing the Hamiltonian Index of Graphs -- A Lower Bound for the Query Phase of Contraction Hierarchies and Hub Labels -- Kernelization of Arc Disjoint Cycle Packing in $\alpha$-bounded Digraphs -- On Subquadratic Derivational Complexity of Semi-Thue Systems -- The Untold Story of SBP -- Weighted Rooted Trees: Fat or Tall -- Groupoid Action and Rearrangement Problem of Bicolor Arrays by Prefix Reversals.
    Content: This book constitutes the proceedings of the 15th International Computer Science Symposium in Russia, CSR 2020, held in Yekaterinburg, Russia, in June 2020. The 25 full papers and 6 invited papers were carefully reviewed and selected from 49 submissions. The papers cover a broad range of topics, such as: algorithms and data structures; computational complexity, including hardness of approximation and parameterized complexity; randomness in computing, approximation algorithms, fixed-parameter algorithms; combinatorial optimization, constraint satisfaction, operations research; computational geometry; string algorithms; formal languages and automata, including applications to computational linguistics; codes and cryptography; combinatorics in computer science; computational biology; applications of logic to computer science, proof complexity; database theory; distributed computing; fundamentals of machine learning, including learning theory, grammatical inference and neural computing; computational social choice; quantum computing and quantum cryptography; theoretical aspects of big data. The conference was cancelled as a live conference due to the corona pandemic.
    Additional Edition: ISBN 9783030500252
    Additional Edition: ISBN 9783030500276
    Additional Edition: Erscheint auch als Druck-Ausgabe International Computer Science Symposium (15. : 2020 : Online) Computer science - theory and applications Cham : Springer, 2020 ISBN 9783030500252
    Additional Edition: Erscheint auch als Druck-Ausgabe ISBN 9783030500276
    Language: English
    Keywords: Approximation ; Komplexitätstheorie ; Konferenzschrift
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 8
    UID:
    b3kat_BV010219952
    Format: 30 S. , graph. Darst.
    Series Statement: Aachener Informatik-Berichte 94,22
    Note: Literaturverz. S. 27 - 30
    Language: German
    Keywords: Hochschulschrift
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 9
    UID:
    gbv_1649273266
    Format: Online-Ressource
    ISBN: 9783540457909 , 3540442391
    Series Statement: Lecture Notes in Computer Science 2484
    Content: Contributions -- Inference of Sequential Association Rules Guided by Context-Free Grammars -- PCFG Learning by Nonterminal Partition Search -- Inferring Subclasses of Regular Languages Faster Using RPNI and Forbidden Configurations -- Beyond EDSM -- Consistent Identification in the Limit of Rigid Grammars from Strings Is NP-hard -- Some Classes of Regular Languages Identifiable in the Limit from Positive Data -- Learning Probabilistic Residual Finite State Automata -- Fragmentation: Enhancing Identifiability -- On Limit Points for Some Variants of Rigid Lambek Grammars -- Generalized Stochastic Tree Automata for Multi-relational Data Mining -- On Sufficient Conditions to Identify in the Limit Classes of Grammars from Polynomial Time and Data -- Stochastic Grammatical Inference with Multinomial Tests -- Learning Languages with Help -- Incremental Learning of Context Free Grammars -- Estimating Grammar Parameters Using Bounded Memory -- Stochastic k-testable Tree Languages and Applications -- Fast Learning from Strings of 2-Letter Rigid Grammars -- Learning Locally Testable Even Linear Languages from Positive Data -- Inferring Attribute Grammars with Structured Data for Natural Language Processing -- A PAC Learnability of Simple Deterministic Languages -- On the Learnability of Hidden Markov Models -- Shallow Parsing Using Probabilistic Grammatical Inference -- Learning of Regular Bi-? Languages -- Software Descriptions -- The EMILE 4.1 Grammar Induction Toolbox -- Software for Analysing Recurrent Neural Nets That Learn to Predict Non-regular Languages -- A Framework for Inductive Learning of Typed-Unification Grammars -- A Tool for Language Learning Based on Categorial Grammars and Semantic Information -- ‘NAIL’: Artificial Intelligence Software for Learning Natural Language -- Lyrebird™: Developing Spoken Dialog Systems Using Examples -- Implementing Alignment-Based Learning.
    Content: The Sixth International Colloquium on Grammatical Inference (ICGI2002) was held in Amsterdam on September 23-25th, 2002. ICGI2002 was the sixth in a series of successful biennial international conferenceson the area of grammatical inference. Previous meetings were held in Essex, U.K.; Alicante, Spain; Mo- pellier, France; Ames, Iowa, USA; Lisbon, Portugal. This series of meetings seeks to provide a forum for the presentation and discussion of original research on all aspects of grammatical inference. Gr- matical inference, the process of inferring grammars from given data, is a ?eld that not only is challenging from a purely scienti?c standpoint but also ?nds many applications in real-world problems. Despite the fact that grammatical inference addresses problems in a re- tively narrow area, it uses techniques from many domains, and is positioned at the intersection of a number of di?erent disciplines. Researchers in grammatical inference come from ?elds as diverse as machine learning, theoretical computer science, computational linguistics, pattern recognition, and arti?cial neural n- works. From a practical standpoint, applications in areas like natural language - quisition, computational biology, structural pattern recognition, information - trieval, text processing, data compression and adaptive intelligent agents have either been demonstrated or proposed in the literature. The technical program included the presentation of 23 accepted papers (out of 41 submitted). Moreover, for the ?rst time a software presentation was or- nized at ICGI. Short descriptions of the corresponding software are included in these proceedings, too.
    Note: Literaturangaben , Lizenzpflichtig
    Additional Edition: ISBN 9783540442394
    Additional Edition: Buchausg. u.d.T. ICGI (6 : 2002 : Amsterdam) Grammatical inference: algorithms and applications Berlin : Springer, 2002 ISBN 3540442391
    Language: English
    Subjects: Computer Science
    RVK:
    Keywords: Maschinelles Lernen ; Formale Grammatik ; Inferenz ; Konferenzschrift
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext  (lizenzpflichtig)
    URL: Cover
    Author information: Adriaans, Pieter 1955-
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 10
    UID:
    edochu_18452_26183
    Format: 1 Online-Ressource (66 Seiten)
    Content: In the smallest grammar problem, we are given a word w and we want to compute a preferably small context-free grammar G for the singleton language {w} (where the size of a grammar is the sum of the sizes of its rules, and the size of a rule is measured by the length of its right side). It is known that, for unbounded alphabets, the decision variant of this problem is NP-hard and the optimisation variant does not allow a polynomial-time approximation scheme, unless P = NP. We settle the long-standing open problem whether these hardness results also hold for the more realistic case of a constant-size alphabet. More precisely, it is shown that the smallest grammar problem remains NP-complete (and its optimisation version is APX-hard), even if the alphabet is fixed and has size of at least 17. The corresponding reduction is robust in the sense that it also works for an alternative size-measure of grammars that is commonly used in the literature (i. e., a size measure also taking the number of rules into account), and it also allows to conclude that even computing the number of rules required by a smallest grammar is a hard problem. On the other hand, if the number of nonterminals (or, equivalently, the number of rules) is bounded by a constant, then the smallest grammar problem can be solved in polynomial time, which is shown by encoding it as a problem on graphs with interval structure. However, treating the number of rules as a parameter (in terms of parameterised complexity) yields W[1]-hardness. Furthermore, we present an O(3∣w∣) exact exponential-time algorithm, based on dynamic programming. These three main questions are also investigated for 1-level grammars, i. e., grammars for which only the start rule contains nonterminals on the right side; thus, investigating the impact of the “hierarchical depth” of grammars on the complexity of the smallest grammar problem. In this regard, we obtain for 1-level grammars similar, but slightly stronger results.
    Content: Peer Reviewed
    In: New York : Springer, 65,2, Seiten 344-409
    Language: English
    URL: Volltext  (kostenfrei)
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. Further information can be found on the KOBV privacy pages