Results 31 to 40 of about 165 (120)
Compact Suffix Trees Resemble PATRICIA Tries: Limiting Distribution of the Depth
, 2008 . Suffix trees are the most frequently used data structures in algorithms on words. In this paper, we consider the depth of a compact suffix tree, also known as the PAT tree, under some simple probabilistic assumptions. For a biased memoryless source, we
Wojciech Szpankowski, Bonita Mcvey
core
Fast as a shadow, expressive as a tree: Hybrid memory monitoring for C.
, 2015 Conference of 30th Annual ACM Symposium on Applied Computing, SAC 2015 ; Conference Date: 13 April 2015 Through 17 April 2015; Conference Code:117701International audienceOne classical approach to ensuring memory safety of C programs is based on storing ...
Signoles, J. +5 more
core +1 more source
Compact Suffix Trees Resemble Patricia Tries: Limiting Distribution of Depth
, 1992 Projet ICSLASuffix trees are the most frequently used data structure in algorithms on words. Despite this, little is known about their behavior in a probabilistic framework. In this paper, we consider the depth of a compact suffix tree, also known as the
Rais, Bonita +4 more
core
Compact suffix trees resemble PATRICIA tries : limiting distribution of depth
, 1993 Projet ICSLASuffix trees are the most frequently used data structure in algorithms on words. Despite this, little is known about their behavior in a probabilistic framework. In this paper, we consider the depth of a compact suffix tree, also known as the
Jacquet, Philippe +2 more
core
Optimizing Registration Based Encryption [PDF]
, 2021 The recent work of Garg et al. from TCC\u2718 introduced the notion of registration based encryption (RBE). The principal motivation behind RBE is to remove the key escrow problem of identity based encryption (IBE), where the IBE authority is trusted to ...
Kelong Cong +2 more
core
Compressed string dictionaries via Rear coding and succinct Patricia Trie
In this thesis, we will illustrate a two-level approach to compress and index string dictionaries, which are a crucial component of many software platforms for big data applications.
ROTUNDO, MARIAGIOVANNA
core
Optimizing Frequency Queries for Data Mining Applications
, 2007 Data mining algorithms use various Trie and bitmap-based representations to optimize the support (i.e., frequency) counting performance. In this paper, we compare the memory requirements and support counting performance of FP Tree, and Compressed ...
Malik, Hassan H., Kender, John R.
core +1 more source
Distributed true string B-tree peer-to-peer overlay networks
, 2006 A fundamental problem that confronts P2P Internet applications is to efficiently locate the physical (IP) node that stores a particular data item. To tackle this application-level routing problem, this thesis proposes a new P2P overlay network, called ...
Wu, Li
core +2 more sources
Exploring the Effects of Meditation Techniques Used by Mindfulness-Based Programs on the Cognitive, Social-Emotional, and Academic Skills of Children: A Systematic Review. [PDF]
Front Psychol, 2021 Filipe MG +7 more
europepmc +1 more source
, 2001 LC tries were introduced by Andersson and Nilsson in 1993. They are compacted versions of tries or patricia tries in which, from the top down, maximal height complete subtrees are level compressed.
Luc Devroye
core