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 13 of 13 for “"Prefix Tree"”.
-
A differential privacy-preserving data publishing algorithm for bus trajectory analysis: A case study on BC Transit
… algorithms are then applied: • Noisy Prefix Tree (Rui Chen et al., 2011): A prefix tree-based DP algorithm for sequential data. • PPDP (Yang Li et al., 2020): An improved prefix tree algorithm tailored for transit smart card data. We also compare the count queries on the original data …
-
Query Segmentation For E-Commerce Sites
… segmentation methodology which is based on prefix tree, mutual information and relative frequency count to compute the score of query pairs and involve Wikipedia for new words recognition. Furthermore, we use two unique E-Commerce evaluation methods to quantify the accuracy of our query …
-
Optimal Path-Decomposition of Tries
… the path-decomposition representation of prefix trees. We show that given query probabilities for every word in the prefix tree, 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 …
-
Analyzing frequent patterns in data streams using a dynamic compact stream pattern algorithm
… the concept of Dynamic Compact Pattern Stream tree (DCPS-tree) algorithm for mining recent data from the continuous data stream. Our DCPS-tree will dynamically achieves frequency descending prefix tree structure with only a single-pass over the data by applying tree restructuring techniques …
-
Efficiently mining frequent itemsets from very large databases
… cube computation have been implemented using a prefix-tree structure, known as a FP-tree, for storing compressed frequency information. Numerous experimental results have demonstrated that these algorithms perform extremely well. In this thesis we present a novel FP-array technique that greatly …
-
Leveraging RRAM to Design Efficient Digital Circuits and Systems for Beyond Von Neumann in-Memory Computing
… ripple-carry adder (RCA), pipelined RCA, and prefix tree adder are shown as example circuits, using the same regular chain structure, to validate the design efficiency. The design principles, computational complexity, and performance are discussed and compared to the CMOS technology and other …
-
Efficient Influence Related Queries
… methods by imposing a variant of prefix tree structure.
-
Constructing a rule-based classifier system for data inconsistency checking
… techniques build. Second, we utilize a prefix-tree structure and hash-code based method for efficient storage and retrieval of rules to reduce complexity and further improve efficiency. Finally, we extend RHS of traditional association rules to multiple disjunctive rules in order to …
-
NEURONAL ENSEMBLE MODELING AND ANALYSIS WITH VARIABLE ORDER MARKOV MODELS
… Based Compression Algorithms (SBCAs) build a prefix tree to estimate the symbol probability by combining conditional probability of a symbol with a chain rule, given d previous symbols (d ≤ D). In particular, just on the track of previously discussed issues, I took into consideration three …
-
Knihovna pro detekci významových vlastností stromových struktur
Testování multikomponentních IT a IoT systémů, které zpracovávají proudy různých zpráv je složitou úlohou. Proč je to složité? Kvůli množství komponentů, jejích asynchronní interakcí, různým kombinacím události pro testování, testovacímu prostředí, které se liší od reálného a množství dalším …
-
Privacy-preserving biomedical data sharing and computation
Genomic data is being produced rapidly by both individuals and enterprises and needs to be outsourced from local machines to a cloud for better flexibility. Outsourcing also eliminates the local storage management problem for data owners. However, sensitive data must be encrypted by data owners …
-
Grafická demonstrace vybraného algoritmu pro vyhledání směru
… algoritmov pre vyhľadávanie najdlhších zhodných prefixov implementovaných v smerovačoch. Väčšia časť práce sa venuje algoritmu Tree Bitmap, ktorého demonštračný program bolo treba vytvoriť. Činnosť tohto algoritmu je zobrazovaná pomocou prehľadných animácií.
-
Generická analýza toků v počítačových sítích
… využívá deterministické konečné automaty , prefixové stromy a analýzu opakovatelnosti. Ve druhé části této diplomové práce se zaměřujeme na implementaci programu, který je schopný na základě takového modelu komunikace verifikovat síťový provoz v reálném čase.