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 trees"”.
-
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 …
-
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 …
-
Pattern matching encryption, strategic equivalence of range voting and approval voting, and statistical robustness of voting rules
… supporting pattern matching queries, based on suffix trees. Storage and communication complexity are comparable to those for (unencrypted) suffix trees. The construction is based only on symmetric-key primitives, so it is practical. 2. Strategic equivalence of range voting and approval voting: …
-
Generic Reinforcement Learning Beyond Small MDPs
… The current state-of-the-art in FRL uses suffix trees which have issues with large observation spaces and long-term dependencies. We start by addressing the issue of long-term dependency using a class of maps known as looping suffix trees, which have previously been used to represent …
-
Generic Reinforcement Learning Beyond Small MDPs
… The current state-of-the-art in FRL uses suffix trees which have issues with large observation spaces and long-term dependencies. We start by addressing the issue of long-term dependency using a class of maps known as looping suffix trees, which have previously been used to represent …
-
Elucidation of Transcriptional Regulatory Relationships Via Information Theoretic Clustering and Consensus Nucleotide Motif Extraction
… genes. This approach utilizes probabilistic suffix trees to extract consensus motif candidates from upstream or downstream noncoding regions, statistically quantifies their significance, then consolidates and displays the results in a web-based interface. Application of this method to …