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 6 of 6 for “"Suffix Tree"”.

  1. Real-time video compression using DVQ and suffix trees

    … of differential vector quantization and the suffix tree. Differential vector quantization is a relatively new area that focuses on efficient compression of data. The present work integrates the compression provided by Differential vector Quantization and the speed achieved by using the suffix …

    wvu Repository record for Real-time video compression using DVQ and suffix trees (opens in a new tab)

  2. Suffix Trees for Document Retrieval

    … thesis presents a look at the suitability of Suffix Trees for full text indexing and retrieval. Typically suffix trees are built on a character level, where the tree records which characters follow each other character. By building suffix trees for documents based on words instead of …

    calpoly Repository record for Suffix Trees for Document Retrieval (opens in a new tab)

  3. Unsupervised discovery of activity primitives from multivariate sensor data

    … which can be efficiently analyzed using a suffix tree, local discretization with a corresponding random projection algorithm for locating similar pairs of subsequences, and a density-based detection method that operates on the original, real-valued data. In addition, a new variation of the …

    gatech Repository record for Unsupervised discovery of activity primitives from multivariate sensor data (opens in a new tab)

  4. Improving the Performance and Precision of Bioinformatics Algorithms

    … to use an eager write-only top-down (WOTD) suffix tree to efficiently align DNA sequences against known genomes. Experimental results show that ESTmapper can be much faster than previous techniques for aligning and clustering DNA sequences, and produces alignments of comparable or better …

    maryland Repository record for Improving the Performance and Precision of Bioinformatics Algorithms (opens in a new tab)

  5. Efficient Substring Discovery Using Suffix, LCP Array and Algorithm-Architecture Interaction

    … when we preprocess the database in the form suffix array. Due to inherent organization of data in suffix array and it’s secondary data structure longest common prefix (LCP) array (Manber and Myers 1990) only a limited portion of the database is accessed during the searching operation which …

    lsu-thes Repository record for Efficient Substring Discovery Using Suffix, LCP Array and Algorithm-Architecture Interaction (opens in a new tab)

  6. Reprezentace textu a její vliv na kategorizaci

    Diplomová práce se zabývá strojovým zpracováním textových dat. V teoretické části jsou popsány problémy související se zpracováním přirozeného jazyka a dále jsou představeny různé způsoby předzpracování a reprezentace textu. Práce se také blíže věnuje použití N-gramů jako rysů pro reprezentaci …

    brno-tech Repository record for Reprezentace textu a její vliv na kategorizaci (opens in a new tab)