Sökning: "edit-distance"

Hittade 4 avhandlingar innehållade ordet edit-distance.

  1. 1. Life of a Security Middlebox : Challenges with Emerging Protocols and Technologies

    Författare :Zeeshan Afzal; Stefan Lindskog; Tomas Olovsson; Karlstads universitet; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; network security; TCP; MPTCP; IDS; Snort; edit-distance; encryption; Computer Science; Datavetenskap;

    Sammanfattning : The Internet of today has intermediary devices known as middleboxes that perform more functions than the normal packet forwarding function of a router. Security middleboxes are a subset of these middleboxes and face an increasingly difficult task to perform their functions correctly. LÄS MER

  3. 2. Towards Secure Multipath TCP Communication

    Författare :Zeeshan Afzal; Stefan Lindskog; Anna Brunstrom; Stefan Axelsson; Karlstads universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; network security; MPTCP; TCP; IDS; snort; edit-distance; Computer Science; Datavetenskap;

    Sammanfattning : The evolution in networking coupled with an increasing demand to improve user experience has led to different proposals to extend the standard TCP. Multipath TCP (MPTCP) is one such extension that has the potential to overcome few inherent limitations in the standard TCP. LÄS MER

  4. 3. Spelling Normalisation and Linguistic Analysis of Historical Text for Information Extraction

    Författare :Eva Pettersson; Joakim Nivre; Beáta Megyesi; Michael Piotrowski; Uppsala universitet; []
    Nyckelord :NLP for historical text; spelling normalisation; digital humanities; information extraction; character-based statistical machine translation; SMT; Levenshtein edit distance; language technology; computational linguistics; Computational Linguistics; Datorlingvistik;

    Sammanfattning : Historical text constitutes a rich source of information for historians and other researchers in humanities. Many texts are however not available in an electronic format, and even if they are, there is a lack of NLP tools designed to handle historical text. LÄS MER

  5. 4. Constraints for Membership in Formal Languages under Systematic Search and Stochastic Local Search

    Författare :Jun He; Pierre Flener; Justin Pearson; Yves Deville; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; constraint programming; regular constraint; automaton constraint; context-free grammar constraint; solution neighbourhood; counter automaton; Datavetenskap; Computer Science;

    Sammanfattning : This thesis focuses on constraints for membership in formal languages under both the systematic search and stochastic local search approaches to constraint programming (CP). Such constraints are very useful in CP for the following three reasons: They provide a powerful tool for user-level extensibility of CP languages. LÄS MER