Sökning: "henrik frank"

Hittade 5 avhandlingar innehållade orden henrik frank.

  1. 1. Path planning using probabilistic cell decomposition

    Författare :Frank Lingelbach; Bo Wahlberg; Henrik I. Christensen; KTH; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Signalbehandling; Signalbehandling; Signal processing; Signalbehandling;

    Sammanfattning : The problem of path planning occurs in many areas, such as computational biology, computer animations and computer-aided design. It is of particular importance in the field of robotics. Here, the task is to find a feasible path/trajectory that the robot can follow from a start to a goal configuration. LÄS MER

  3. 2. Complexities of Order-Related Formal Language Extensions

    Författare :Martin Berglund; Frank Drewes; Henrik Björklund; Markus Holzer; Umeå universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; complexity; automata; languages; order; shuffle; regular expressions; context-free; mildly context-sensitive; parsing; membership; algorithm analysis; Computer Science; datalogi;

    Sammanfattning : The work presented in this thesis discusses various formal language formalisms that extend classical formalisms like regular expressions and context-free grammars with additional abilities, most relating to order. This is done while focusing on the impact these extensions have on the efficiency of parsing the languages generated. LÄS MER

  4. 3. Complexity and expressiveness for formal structures in Natural Language Processing

    Författare :Petter Ericson; Henrik Björklund; Frank Drewes; Umeå universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; graph grammars; formal languages; natural language processing; parameterized complexity; abstract meaning representation; tree automata; deterministic tree-walking transducers; mildly context-sensitive languages; hyperedge replacement; tree adjoining languages; minimally adequate teacher;

    Sammanfattning : The formalized and algorithmic study of human language within the field of Natural Language Processing (NLP) has motivated much theoretical work in the related field of formal languages, in particular the subfields of grammar and automata theory. Motivated and informed by NLP, the papers in this thesis explore the connections between expressibility – that is, the ability for a formal system to define complex sets of objects – and algorithmic complexity – that is, the varying amount of effort required to analyse and utilise such systems. LÄS MER

  5. 4. Order-preserving graph grammars

    Författare :Petter Ericson; Henrik Björklund; Frank Drewes; Sebastian Maneth; Umeå universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Graph grammars; graph parsing; graph series; hyperedge replacement; uniform parsing problem; abstract meaning representation; semantic modelling; order preservation; reentrancy preservation; minimally adequate teacher; weighted graph grammars;

    Sammanfattning : The field of semantic modelling concerns formal models for semantics, that is, formal structures for the computational and algorithmic processing of meaning. This thesis concerns formal graph languages motivated by this field. LÄS MER

  7. 5. An Informed System Development Approach to Tropical Cyclone Track and Intensity Forecasting

    Författare :Chandan Roy; Rita Kovordanyi; Henrik Eriksson; Mattias Villani; Frank C. Lin; Linköpings universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Biologically based artificial neural networks; bi-directionally connected networks; temporal sequence learning; accurate tropical cyclone forecasting; informative warning message; ;

    Sammanfattning : Introduction: Tropical Cyclones (TCs) inflict considerable damage to life and property every year. A major problem is that residents often hesitate to follow evacuation orders when the early warning messages are perceived as inaccurate or uninformative. LÄS MER