Sökning: "pattern-matching algorithm"

Visar resultat 1 - 5 av 13 uppsatser innehållade orden pattern-matching algorithm.

  1. 1. Evaluating Performance of Pattern Searching Algorithms on Wildcard Patterns

    Kandidat-uppsats, Umeå universitet/Institutionen för datavetenskap

    Författare :Gustav Lindblad; [2023]
    Nyckelord :;

    Sammanfattning : The pattern matching problem is the problem of finding a set of sequential characters in a text of equal amount of characters or more. There are many applications for pattern matching algorithms e.g. search engines and databases. LÄS MER

  3. 2. Retrofitting analogue meters with smart devices : A feasibility study of local OCR processes on an energy critical driven system

    Kandidat-uppsats,

    Författare :Joel Andreasson; Elin Ehrenbåge; [2023]
    Nyckelord :Analogue meters; Energy efficiency; Internet of Things IoT ; Optical Character Recognition OCR ; Sum of Absolute Differences SAD ; Template matching;

    Sammanfattning : Internet of Things (IoT) are becoming increasingly popular replacements for their analogue counterparts. However, there is still demand to keep analogue equipment that is already installed, while also having automated monitoring of the equipment, such as analogue water meters. LÄS MER

  4. 3. Early Automated Risk Assessment of CVE Descriptions

    Kandidat-uppsats, Linköpings universitet/Institutionen för datavetenskap

    Författare :Felix Nyrfors; Ludvig Sandholm; [2022]
    Nyckelord :;

    Sammanfattning : Data security is becoming more relevant as more and more information is stored digitally and many new data vulnerabilities are found everyday. To keep track of what software programs could be exposed, databases such as the NVD that try to list all identified vulnerabilities were created. LÄS MER

  5. 4. A Parallelized Naïve Algorithm for Pattern Matching

    Kandidat-uppsats, Umeå universitet/Institutionen för datavetenskap

    Författare :William Svensson; [2022]
    Nyckelord :Pattern matching; Parallel programming;

    Sammanfattning : The pattern matching is the problem of locating one string, a pattern, inside another, a text, which is required in for example databases, search engines, and text editors. Thus, several algorithms have been created to tackle this problem and this thesis evaluates whether a parallel version of the Naïve algorithm, given a reasonable amount of threads for a personal computer, could become more efficient than some state-of-the-art algorithms used today. LÄS MER

  7. 5. An Extension of The Berry-Ravindran Algorithm for protein and DNA data

    Kandidat-uppsats, Umeå universitet/Institutionen för datavetenskap

    Författare :Jesper Riekkola; [2022]
    Nyckelord :Berry-Ravindran; text matching; string matching; exact-matching string algorithms; pattern matching; Berry-Ravindran; textmatchning; strängmatchning;

    Sammanfattning : String matching algorithms are the algorithms used to search through different types of text in search of a certain pattern. Many of these algorithms achieve their impressive performance by analysing the pattern and saving that information. LÄS MER