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 92 for “"trie"”.

  1. Struktury trie pro zpracování rozsáhlých textových dat

    Táto práca rozoberá spracovanie prirodzeného jazyka so zameraním sa na morfologickú analýzu a spoznávanie pomenovaných entít. Rozoberá efektívne vyhľadávanie v slovníkoch a v ňom používaných špecializovaných stručných štruktúr a ich praktické implementácie. Popisuje návrh a implementáciu systému …

    brno-tech Repository record for Struktury trie pro zpracování rozsáhlých textových dat (opens in a new tab)

  2. SPLCHK: A VAX/VMS spelling checker and corrector utilizing a trie-structured dictionary

    … and corrector written in C, which utilizes a "trie" structure to store its main dictionary of words, thereby eliminating redundancy of letters. The program allows the user to either check the spelling of words or files, or to correct "misspelled" words in files. The program is designed to …

    rit Repository record for SPLCHK: A VAX/VMS spelling checker and corrector utilizing a trie-structured dictionary (opens in a new tab)

  3. Dynamic construction of trie-based automata for approximate K-mer matching on heterogeneous CPU-GPU systems

    … this by using the CPU to dynamically construct a trie-based automata structure while the GPU provides the k-mer matching mechanism. It will cover the implementation and optimization of GPU kernels used for k-mer matching, implementation of 2 intermediate automata structures operated on by the CPU, …

    missouri Repository record for Dynamic construction of trie-based automata for approximate K-mer matching on heterogeneous CPU-GPU systems (opens in a new tab)

  4. An Arbitrary CRCW PRAM Algorithm for Sorting Integers Into a LinkedList and Chaining on a Trie

    … CRCW PRAM model. Part two is Chaining on a Trie. This research paper solves the problem of chaining on a Trie by providing more efficient complexity. This Algorithm takes “constant time” using n(logm+1) processors to chain the nodes on a Trie for n input integers on the Arbitrary CRCW PRAM …

    umkc Repository record for An Arbitrary CRCW PRAM Algorithm for Sorting Integers Into a LinkedList and Chaining on a Trie (opens in a new tab)

  5. Towards expressive melodic accompaniment using parametric modeling of continuous musical elements in a multi-attribute prediction suffix trie framework

    … framework that uses a multi-attribute trie / n-gram structure to model parameters like frequency, depth and/or lag of the expressive variations such as vibrato and portamento, along with conventionally modeled elements such as musical notes, their durations and metric positions in …

    gatech Repository record for Towards expressive melodic accompaniment using parametric modeling of continuous musical elements in a multi-attribute prediction suffix trie framework (opens in a new tab)

  6. Non-Blocking Data Structures Handling Multiple Changes Atomically

    … structures, doubly-linked lists and Patricia tries. In our implementations, only update operations perform CAS instructions; operations other than updates perform only reads of shared memory. Our doubly-linked list implements a novel specification that is designed to make it easy to use as a …

    york Repository record for Non-Blocking Data Structures Handling Multiple Changes Atomically (opens in a new tab)

  7. Vyhledání nejdelšího shodného prefixu

    … protokol verze 6. Jsou vybrány algoritmy Binary Trie, Level Compressed Trie, Lulea Compressed Trie a Binary Search on Intervals, které jsou nejdříve popsány a poté testovány s cílem najít nejvhodnější algoritmus z hlediska pamětových nároků a rychlosti vyhledání.

    brno-tech Repository record for Vyhledání nejdelšího shodného prefixu (opens in a new tab)

  8. Algoritmy pro vysokorychlostní směrování v IP sítích

    … v IP sítích nejdelší shodný prefix, konkrétně Trie, Tree Bitmap a Shape Shifting Trie. Algoritmy jsou implementovány softwarově a je zkoumána jejich paměťová a výpočetní náročnost.

    brno-tech Repository record for Algoritmy pro vysokorychlostní směrování v IP sítích (opens in a new tab)

  9. Towards more power efficient IP lookup engines

    … software or hardware implementations of routing trie based approaches require several memory accesses in order to perform a single memory lookup, which limits the throughput considerably. On the other hand, IP lookup throughput requirements have been continuously increasing. This has led to …

    tamu Repository record for Towards more power efficient IP lookup engines (opens in a new tab)

  10. Optimal Path-Decomposition of Tries

    … the heavy-path strategy produces the optimal trie with respect to the number of node accesses. We show how to implement the heavy-path strategy in O(N) time for a trie containing n words with total length N. To prove this result, we show a complete characterization of the choices made by the …

    waterloo Repository record for Optimal Path-Decomposition of Tries (opens in a new tab)

  11. Grafická demonstrace vybraného algoritmu pro vyhledání směru

    … nevýhody jednotlivých řešení. Popisuje strukturu trie a její varianty. Detailně popisuje strukturu shape shifting trie, metodu jejího vytváření a způsob průchodu touto strukturou - vyhledávací algoritmus SST. Popisuje návrh a implementaci aplikace, která graficky demonstruje průběh vyhledávání v …

    brno-tech Repository record for Grafická demonstrace vybraného algoritmu pro vyhledání směru (opens in a new tab)

  12. Clustering for DNA Storage

    … domains become time-consuming. Recently, a trie-based algorithm called Clover is proposed to accelerate the clustering process in DNA storage by fuzzy searching the input reads on a trie structure. However, it only considers substitutions during the search, while deletions and insertions are …

    chalmers Repository record for Clustering for DNA Storage (opens in a new tab)

  13. A nearest neighbor search method suitable for low dimensions and location-dependent spatial queries in mobile computing

    … by the grid space partitioning and the compact trie tree structure. A detailed implementation based on the Best-First-Nearest-Neighbor-Search scheme is presented and illustrated with sample data. Then k-nearest-neighbor search performance comparison is carried out among the proposed …

    lethbridge Repository record for A nearest neighbor search method suitable for low dimensions and location-dependent spatial queries in mobile computing (opens in a new tab)

  14. Weighted Set Containment in Redundant Data Sets

    … set containment can be solved efficiently using trie based preprocessing when applied to redundant data sets. We show that finding the most efficient trie which represents F is NP-complete and we introduce a number of approximation algorithms. We show through empirical testing that some of our …

    chalmers Repository record for Weighted Set Containment in Redundant Data Sets (opens in a new tab)

Page 1 of 5