Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 620 for “"Pattern Matching"”.

  1. Dynamic multiple pattern matching

    Pattern matching algorithms are among the most important and practical contribution of theoretical computer science. Pattern matching is used in a wide variety of applications such as text editing, information retrieval, DNA sequencing, and computer vision. Several combinatorial problems arise in …

    rice Repository record for Dynamic multiple pattern matching (opens in a new tab)

  2. Machine Translation by Pattern Matching

    … proposed a solution that we call "translation by pattern matching", which we bring to fruition in this dissertation. The training data itself serves as a proxy to the model; rules and parameters are computed on demand. It achieves our desiderata of minimal offline computation and compact …

    maryland Repository record for Machine Translation by Pattern Matching (opens in a new tab)

  3. An Overlay Architecture for Pattern Matching

    Deterministic and Non-deterministic Finite Automata (DFA and NFA) comprise the fundamental unit of work for many emerging big data applications, motivating recent efforts to develop Domain-Specific Architectures (DSAs) to exploit fine-grain parallelism available in automata workloads. This …

    south-carolina Repository record for An Overlay Architecture for Pattern Matching (opens in a new tab)

  4. A pattern matching system for biosequences.

    String pattern matching is an extensively studied area of computer science. Over the past few decades, many important theoretical results have been discovered, and a large number of practical algorithms has been developed for efficiently matching various classes of patterns. A variety of general …

    arizona-thes Repository record for A pattern matching system for biosequences. (opens in a new tab)

  5. Approximate pattern matching and its applications.

    In this thesis, we study approximate pattern matching problems. Our study is based on the Levenshtein distance model, where errors considered are 'insertions', 'deletions', and 'substitutions'. In general, given a text string, a pattern, and an integer k, we want to find substrings in the text that …

    arizona-thes Repository record for Approximate pattern matching and its applications. (opens in a new tab)

  6. Efficient processing of XML twig pattern matching

    … selection on the structure of an XML document. Matching a twig query means finding all the instances of the query tree embedded in the XML data tree. We present in this thesis a series of new holistic twig join algorithms by which query trees are matched as a whole so that the size of irrelevant …

    nus Repository record for Efficient processing of XML twig pattern matching (opens in a new tab) Download file for Efficient processing of XML twig pattern matching (opens in a new tab)

  7. OOMatch: Pattern Matching as Dispatch in Java

    … allows method parameters to be specified as patterns, which are matched against the arguments to the method call. When matches occur, the method applies; if multiple methods apply, the method with the more specific pattern overrides the others. The pattern matching is very similar to that …

    waterloo Repository record for OOMatch: Pattern Matching as Dispatch in Java (opens in a new tab)

  8. Software Architecture Recovery based on Pattern Matching

    Pattern matching approaches in reverse engineering aim to incorporate domain knowledge and system documentation in the software architecture extraction process, hence provide a user/tool collaborative environment for architectural design recovery. This thesis presents a model and an environment for …

    waterloo Repository record for Software Architecture Recovery based on Pattern Matching (opens in a new tab)

  9. Compressed Pattern Matching For Text And Images

    … data using available resources. The compressed pattern matching problem can be stated as: given the compressed format of a text or an image and a pattern string or a pattern image, report the occurrence(s) of the pattern in the text or image with minimal (or no) decompression. The main …

    ucf Repository record for Compressed Pattern Matching For Text And Images (opens in a new tab)

  10. Point pattern matching by a genetic algroithm

    … we consider is to find a subset of points in a pattern that best match to a subset of points in another pattern through a transformation in a least squares sense. Exhaustive search to find the best assignment mapping one set of points to another set is, if the number of points that are to be …

    njit Repository record for Point pattern matching by a genetic algroithm (opens in a new tab)

  11. Non-Strict Pattern Matching and Delimited Control

    Η έννοια της συνέχειας ενός προγράμματος έχει αποδειχθεί ιδιαιτέρως χρήσιμη σε ένα ευρύ φάσμα ερευνητικών περιοχών που σχετίζονται με συναρτησιακές γλώσσες προγραμματισμού. Η εργασία αυτή μελετά μηχανισμούς αφαίρεσης ελέγχου οι οποίοι είναι ευρύτερα γνωστοί ως τελεστές ελέγχου και επιτρέπουν τη …

    athens Repository record for Non-Strict Pattern Matching and Delimited Control (opens in a new tab)

  12. Graph Pattern Matching on Symmetric Multiprocessor Systems

    … a processing perspective, finding comprehensive patterns in graph-structured data is a core processing primitive in a variety of applications, such as fraud detection, biological engineering or social graph analytics. On the hardware side, multiprocessor systems, that consist of multiple …

    qucosa-diss

  13. Pattern matching in massive metadata graphs at scale

    Pattern matching in graphs, that is finding subgraphs that match a smaller template graph within the large background graph is fundamental to graph analysis and serves a rich set of applications. Unfortunately, existing solutions have limited scalability, are difficult to parallelize, support only …

    ubc Repository record for Pattern matching in massive metadata graphs at scale (opens in a new tab) Download PDF for Pattern matching in massive metadata graphs at scale (opens in a new tab)

  14. Automatic conceptual window grouping with frequent pattern matching

    … Conceptual Groups. The approach applies frequent pattern analysis on recorded interaction data and clusters these to retrieve conceptual groups. To measure the accuracy of our approach, we conducted a study with 11 participants and compared it to existing approaches which were outperformed by up …

    ubc Repository record for Automatic conceptual window grouping with frequent pattern matching (opens in a new tab) Download PDF for Automatic conceptual window grouping with frequent pattern matching (opens in a new tab)

Page 1 of 31