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 30 for “"Binary tree"”.
-
Binary tree classifier and context classifier
… classifier are discussed in this paper, one is a binary decision tree classifier based on the Fisher's linear discriminant function as a decision rule at each nonterminal node, and the other is a contextual classifier which gives each pixel the highest probability label given some substantially …
-
Performance Analysis of a Binary-Tree-Based Algorithm for Computing Spatial Distance Histograms
… density map which is implemented via a quad tree index. An algorithm having density maps implemented via binary tree is proposed in this thesis. After carrying out many experiments and analysis of the data, we figure out that although the binary tree approach seems efficient in earlier stage, …
-
Self-stabilizing binary search tree maintenance algorithm
Binary search tree is one of the most studied data structures. The main application of the binary search tree is in implementing efficient search operations. A binary search tree is a special binary tree which satisfies the property that for every processor p in the binary tree, the values of all …
-
Parallel sorting and Star-P data movement and tree flattening
… By representing a computation as a binary tree, which we assume is given, it can be shown that the height corresponds to the parallel execution time, given enough processors. The main result of the chapter is an algorithm that uses tree rotations to reduce the height of an arbitrary …
-
Fast Parallel Algorithms for Basic Problems
… and multiple selection, and reconstruction of a binary tree from its traversals. The research on priority queue was motivated by its various applications. The purpose of studying multiple search and multiple selection is to explore the relationships between four of the most fundamental problems …
-
A data structure for interactive graphic manipulation of logic diagrams
… system. The use of sequential list, hashing, binary tree, and linked list data structures are evaluated, and the data structure is formulated, which includes a combination of linked lists, binary trees, and sequential lists. An illustrative example is presented, along with recommendations for …
-
The Communication Complexity of Distributed Computing and a Parallel Algorithm for Polynomial Roots
… on a ring, a mesh, and a complete binary tree of processors.
-
Recobrimentos no espaço hiperbólico e percolação na árvore binária estendida
We study the percolation problem on the enhanced binary tree, a simple structure that exhibits geometric features of hyperbolic spaces: a non-vanishing surface-volume ratio, the latter being compact. The violation of Euclid s fifth postulate, assuring the possibility of an infinity of paralel to a …
-
Searching for patterns in Conway's Game of Life
… a novel Sat-based approach that replaces the binary tree used by traditional Sat solvers with a grid-based approach, complemented by an injection of Game of Life specific knowledge. This leads to a significant speedup in searching. As a fortunate side effect, our solver can be generalized to …
-
Cache-oblivious dynamic search trees
… implemented a cache-oblivious dynamic search tree as an alternative to the ubiquitious B-tree. I use a binary tree with a "van Endcle Boas" layout whose leaves point to intervals in a "packed memory structure". We refer to the data structure as a COB-Tree. The COB-Tree supports efficient …
-
Novel phylogenetic approaches to problems in microbial genomics
… evolutionary events, and can be formalized using binary tree models known as phylogenies. In this thesis, I present three new phylogenetic methods for gaining insight into how microbes evolve. In Chapter 1, I introduce the algorithm AdaptML, which uses strain ecology information to identify …
-
An Algorithm to Generate Two-Dimensional Drawings of Conway Algebraic Knots
… to the algorithm is a special type of rooted binary tree which represents a distinct prime, alternating Conway algebraic knot. Each leaf in the tree represents a crossing in the knot. The algorithm first generates the tree and then modifies such a tree repeatedly to reduce the number of its …
-
A Method for Clustering High-Dimensional Data Using 1D Random Projections
… top-down hierarchical clustering method using a binary tree of 1D random projections. As real data tends to have a lot of structures, we show that a 1D random projection of real data captures some of that structure with a high probability. More specifically, the structure manifests itself as a …
-
Three-dimensional, in-silico breast phantom for multimodality image simulations
… ductal lobes are simulated following a random binary tree model which is generated based upon probabilistic branching conditions described by ramification matrices, as originally proposed by Bakic et al [3, 4]. The complete ductal structure of the breast is simulated from multiple lobes that …
-
Lexicographic Products of Linear Orderings
… representations of linear orderings by means of trees. We prove the following fact: if alpha is an indecomposable ordinal and L is a linear ordering such that neither alpha nor its reverse ordering alpha* order-embed into L, then L embeds into the lexicographic linearization of a binary tree …
-
Systematic conformational search with constraint satisfaction
… for the parts. However, instead of using a binary tree for straightforward divide-and-conquer, four innovations are introduced: (1) OMNIMERGE searches a subproblem for every possible subchain of the molecule. Searching every subchain provides the advantage that every possible merge is …
-
Single-crossover recombination and ancestral recombination trees
… of infinite population size, this results in binary tree structures, the ancestral recombination trees. The ancestry is then formulated explicitly in terms of a (stochastic) segmentation process, which involves conditional independence between segments once they have occurred. As a …
-
The computational complexity of prefix classes of logical theories
… in $\Pi\sb{2r+5}$ in the theory of finite trees of height at most $r$ have a $NTIME$(exp$\sb{r-2}(c\sqrt{n}/$log $n$)) lower bound. The same technique also gives a lower bound of $NTIME$(exp$\sb{m}(c\sb{m}n\sp{1/3}/$log$\sp2n$)) for the $\Sigma\sb{3m+3}$ formulas in the theory of any …
-
Studies of one-dimensional unimodal maps in the chaotic regime
For one-dimensional uninmodal maps hλ(x) a binary tree which includes all the periodic windows in the chaotic regime is constructed. By associating each element in the tree with the superstable parameter value of the corresponding periodic interval we define a different unimodal map. After applying …
Page 1 of 2