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 25 for “"Subtrees"”.
-
Graphical Indices and their Applications
… index, the degree distance, and the number of subtrees. We find which structure will maximize the Randić index of a class of graphs known as cacti, and we find a functional relationship between the Wiener index and the degree distance for several types of graphs. We also develop an algorithm to …
-
PrologPF: Parallel Logic and Functions on the Delphi Machine
… have completed the search of their assigned subtrees. If one solution is required, the execution of all the path processors is terminated when the control processor receives the first solution. The presence of the extra-logical Prolog predicate cut in the user program conflicts with the use …
-
Graph representations using stars, trees, intervals and boxes
… the intersection graph of unions of t substars (subtrees) of a host tree. We characterize the graphs with star number 1 and prove that a planar graph has star number at most 3. We study bounds on these two parameters and compare them with interval number. We prove that the star number is at most …
-
Identifying similar code fragments in Haskell
… fragments. The LCS algorithm is used to compare subtrees of different syntactic variants. Experiments showed that these algorithms can help better evaluate code fragments to identify duplicates.
-
Tree model guided (TMG) enumeration as the basis for mining frequent patterns from XML documents
… can be utilized not only for enumerating ordered subtrees but also for enumerating unordered subtrees and subsequences. Furthermore, the framework tackles the unprecedented complexity in mining frequent tree-structured patterns by generating only valid candidates with non-zero frequency count and …
-
Mining sophisticated patterns for classification and correlation analysis
… a numeric valued feature set of k-embedded edge subtrees given labeled training data, (2) mining top correlated patterns from transactional databases with low minimum support, and (3) mining flipping correlation patterns from transactional databases given item hierarchy. We evaluate our solutions …
-
Extremal problems on edge-colorings, independent sets, and cycle spectra of graphs
… problem on edge-labeled trees, where we seek subtrees that have a small number of path-labels. In Chapter 5, we examine parity edge-colorings, which have connections to additive combinatorics and the minimum dimension of a hypercube in which a tree embeds. In Chapter 6, we prove results on the …
-
Tree pattern inference and matching for wrapper induction on the World Wide Web
… use the notion of the edit distance between the subtrees represented by these examples to distill them into a more general pattern. This pattern may then be used to retrieve other instances of the selected data from the same page or other similar pages. By linking patterns and their components …
-
A Theory of Stationary Trees and the Balanced Baumgartner-Hajnal-Todorcevic Theorem for Trees
… Todorcevic, we develop a theory of stationary subtrees of trees of successor-cardinal height. We define the diagonal union of subsets of a tree, as well as normal ideals on a tree, and we characterize arbitrary subsets of a non-special tree as being either stationary or non-stationary. We then …
-
Efficient data search and synchronization for tree-structured data on mobile devices
… processes become faster by pruning out entire subtrees from being searched and precisely locate the parts we are looking for. Experiments are performed to verify the efficiency of each method. What’s more, we deploy the search method as an android application for practical purposes on mobile …
-
Genome-wide microbial phylogeny reconstruction with polytomy identification
… classifier to identify possible bifurcating subtrees as polytomies or not from the result trees generated from ComPhy. We have developed a set of two phylogenetic analysis applications, which are fast and robust for genome-wide inference of evolution relationships among microbial genomes.
-
Banach Spaces on Topological Ramsey Structures
… [6]. Finite approximations of the isomorphic subtrees are utilised in constructing the norm. The subspace on each “branch” of the tree is shown to resemble the structure of an ℓ<sub>∞</sub><sup>n+1</sup> -space where the dimension corresponds to the number of terminal nodes on that branch. The …
-
An object-oriented parser generator for LL(1) grammars
… of the root would in turn construct the subtrees of the root. The parsing approach is explained. The design and implementation of key parts of the parser are shown. Also the definition of the language's grammar which contains regular expressions and offer an easy notation to specify …
-
Latent tree structure learning for cross-document coreference resolution
… clustering heuristic can then be used to select subtrees from the learned tree structure as entities. As with other structure learning problems, it is prudent to envoke Occam's razor and perform regularization to obtain the simplest hypothesis. When the state space consists of tree structures, we …
-
Pattern discovery in structural databases with applications to bioinformatics
… data mining technique to find frequent agreement subtrees in multiple phylogenies. The correctness and completeness of the new mining algorithm are presented. The method is also extended to unrooted phylogenetic trees. Both FSM techniques studied in the thesis have been implemented into a toolkit, …
-
Whole-organism integrative expressome for C. elegans enables in silico study of developmental regulation
… exist that switch on or off genes in whole subtrees of the cell pedigree?"; "Which genes are most strongly implicated in apoptosis?", etc. This whole-organism expressome enables direct and powerful in silico analysis of development.
-
Order-Leading Branch and Bound for Neural Network Verification
… quantization or machine-unlearning, only subtrees whose bounds are invalidated are reopened. Our new scheduling approach speeds verification up to 42x compared with the best previous incremental tool and achieves higher verification scalability. Overall, the three contributions establish a …
-
Information overload in structured data
… graphs into certain sub-structures, such as subtrees, or subgraphs. However, existing graph kernels suffer from a few drawbacks. First, the dimension of the feature space associated with the kernel often grows exponentially as the complexity of sub-structures increase. One immediate …
-
Models for Improved Tractability and Accuracy in Dependency Parsing
… in this thesis and quantifies the nesting of subtrees over intervals. The thesis provides O(n6) and O(n5) edge-factored parsing algorithms for two new classes of trees based on this property, and extends the latter to include grandparent factors. This thesis then defines 1-Endpoint-Crossing …
Page 1 of 2