Results 11 to 20 of about 97,608 (260)
Evaluation of teaching quality based on binary tree support vector machine [PDF]
MATEC Web of Conferences, 2022 In order to solve the reliability of the evaluation results of teaching quality in universities and colleges, an improved model of teaching evaluation based on the Support vector machine was put forward. In this model, the evaluator does not need to give
Wu Xinghui +3 more
doaj +1 more source
Non-binary universal tree-based networks
Journal of Graph Algorithms and Applications, 2022 A tree-based network $N$ on $X$ is called universal if every phylogenetic tree on $X$ is a base tree for $N$. Recently, binary universal tree-based networks have attracted great attention in the literature and their existence has been analyzed in various
Mareike Fischer +2 more
doaj +1 more source
Descendants and ascendants in binary trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 1997 There are three classical algorithms to visit all the nodes of a binary tree - preorder, inorder and postorder traversal. From this one gets a natural labelling of the n internal nodes of a binary tree by the numbers 1, 2, ..., n, indicating the sequence
Alois Panholzer, Helmut Prodinger
doaj +1 more source
The Maximum Binary Tree Problem [PDF]
Algorithmica, 2021 to be published in European Symposium on Algorithms ...
Karthekeyan Chandrasekaran +5 more
openaire +4 more sources
A combinatorial method to find sharp lower bounds on flip distances [PDF]
Discrete Mathematics & Theoretical Computer Science, 2013 Consider the triangulations of a convex polygon with $n$ vertices. In 1988, Daniel Sleator, Robert Tarjan, and William Thurston have shown that the flip distance of two such triangulations is at most $2n-10$ when $n$ is greater than 12 and that this ...
Lionel Pournin
doaj +1 more source
Embedding phylogenetic trees in networks of low treewidth [PDF]
Discrete Mathematics & Theoretical Computer Science, 2023 Given a rooted, binary phylogenetic network and a rooted, binary phylogenetic tree, can the tree be embedded into the network? This problem, called \textsc{Tree Containment}, arises when validating networks constructed by phylogenetic inference methods ...
Leo van Iersel +2 more
doaj +1 more source
Linear extension operators for Sobolev spaces on radially symmetric binary trees
Advanced Nonlinear Studies, 2023 Let ...
Fefferman Charles, Klartag Bo’az
doaj +1 more source
A New Comparative Study of Dimensionality Reduction Methods in Large-Scale Image Retrieval
Big Data and Cognitive Computing, 2022 Indexing images by content is one of the most used computer vision methods, where various techniques are used to extract visual characteristics from images.
Mohammed Amin Belarbi +4 more
doaj +1 more source
Supernode Binary Search Trees [PDF]
International Journal of Foundations of Computer Science, 2003 Balanced binary search tree structures such as AVL, red-black, and splay trees store exactly one element per node. We propose supernode versions of these structures in which each node may have a large number of elements. Some properties of supernode binary search tree structures are established.
Haejae Jung, Sartaj Sahni
openaire +1 more source