Search for dissertations about: "deterministic graph"

Showing result 11 - 15 of 19 swedish dissertations containing the words deterministic graph.

  2. 11. Algorithmic Bounds for Presumably Hard Combinatorial Problems

    Author : Andreas Björklund; Institutionen för datavetenskap; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; numerisk analys; system; control; Datalogi; numerical analysis; systems; Computer science; Approximation algorithms; Exact algorithms; NP-hard problems; Algorithm theory; kontroll;

    Abstract : In this thesis we present new worst case computational bounds on algorithms for some of the most well-known NP-complete and #P-complete problems and their optimization variants. We consider graph problems like Longest Path, Maximum Cut, Number of Perfect Matchings, Chromatic and Domatic Number, as well as Maximum k-Satisfiability and Set Cover. READ MORE

  4. 12. Learning of Timed Systems

    Author : Olga Grinchtein; Bengt Jonsson; Oded Maler; Uppsala universitet; []
    Keywords : learning regular languages; timed systems; event-recording automata;

    Abstract : Regular inference is a research direction in machine learning. The goal of regular inference is to construct a representation of a regular language in the form of deterministic finite automaton (DFA) based on the set of positive and negative examples. READ MORE

  5. 13. Inductive Dependency Parsing of Natural Language Text

    Author : Joakim Nivre; Walter Daelemans; Växjö universitet; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; natural language parsing; dependency parsing; memory-based learning; treebank parsing; Systems engineering; Systemteknik; Computer and Information Sciences Computer Science; Data- och informationsvetenskap;

    Abstract : This thesis investigates new methods for syntactic parsing of unrestricted natural language text under requirements of robustness and disambiguation. A parsing system is required to assign to every sentence in a text at least one analysis (robustness) and at most one analysis (disambiguation). READ MORE

  6. 14. Critical Scaling in Particle Systems and Random Graphs

    Author : Vasilii Goriachkin; Matematisk statistik; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; dissipative force; particles collisions; random graphs; random walks; martingales; geometric random graphs; neural networks; critical scaling; diffusion approximation;

    Abstract : The purpose of this thesis is to study the behavior of macro-systems through their micro-parameters. In particular, we are interested in finding critical scaling in various models.Paper I investigates the influence of discrete-time collisions on particle dynamics. READ MORE

  7. 15. Breaking the Dimensionality Curse of Voronoi Tessellations

    Author : Vladislav Polianskii; Florian T. Pokorny; Michael Bronstein; KTH; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; geometric methods; machine learning methods; Voronoi; Delaunay; high dimensional geometry; curse of dimensionality; monte carlo; Datalogi; Computer Science;

    Abstract : Considering the broadness of the area of artificial intelligence, interpretations of the underlying methodologies can be commonly narrowed down to either a probabilistic or a geometric point of view. Such separation is especially prevalent in more classical "pre-neural-network" machine learning if one compares Bayesian modelling with more deterministic models like nearest neighbors. READ MORE