Results 31 to 40 of about 5,273,588 (373)
Local multiset dimension of comb product of tree graphs
AIMS Mathematics, 2023 Resolving set has several applications in the fields of science, engineering, and computer science. One application of the resolving set problem includes navigation robots, chemical structures, and supply chain management. Suppose the set $ W = \left\{{s}
Ridho Alfarisi +2 more
doaj +1 more source
IQ-TREE: A Fast and Effective Stochastic Algorithm for Estimating Maximum-Likelihood Phylogenies
Molecular biology and evolution, 2014 Large phylogenomics data sets require fast tree inference methods, especially for maximum-likelihood (ML) phylogenies. Fast programs exist, but due to inherent heuristics to find optimal trees, it is not clear whether the best tree is found.
Lam-Tung Nguyen +3 more
semanticscholar +1 more source
Data‐driven performance metrics for neural network learning
International Journal of Adaptive Control and Signal Processing, EarlyView., 2023 Summary Effectiveness of data‐driven neural learning in terms of both local mimima trapping and convergence rate is addressed. Such issues are investigated in a case study involving the training of one‐hidden‐layer feedforward neural networks with the extended Kalman filter, which reduces the search for the optimal network parameters to a state ...
Angelo Alessandri +2 more
wiley +1 more source
Trees, Stumps, and Applications
Axioms, 2018 The traditional derivation of Runge–Kutta methods is based on the use of the scalar test problem y′(x)=f(x,y(x)). However, above order 4, this gives less restrictive order conditions than those obtained from a vector test problem using a tree-
John C. Butcher
doaj +1 more source
Are portrait artists superior face recognizers? Limited impact of adult experience on face recognition ability. [PDF]
, 2017 Across two studies, we asked whether extensive experience in portrait art is associated with face recognition ability. In Study 1, 64 students completed a standardized face recognition test before and after completing a year-long art course that included
Jeremy Tree, Ruth Horry
core +1 more source
, 2022 Search trees on trees (STTs) are a far-reaching generalization of binary search trees (BSTs), allowing the efficient exploration of tree-structured domains. (BSTs are the special case in which the underlying domain is a path.) Trees on trees have been extensively studied under various guises in computer science and discrete mathematics.
Berendsohn, Benjamin Aram +1 more
openaire +2 more sources
Pushdown machines for the macro tree transducer [PDF]
, 1986 The macro tree transducer can be considered as a system of recursive function procedures with parameters, where the recursion is on a tree (e.g., the syntax tree of a program).
Engelfriet, Joost, Vogler, Heiko
core +3 more sources
W-IQ-TREE: a fast online phylogenetic tool for maximum likelihood analysis
Nucleic Acids Res., 2016 This article presents W-IQ-TREE, an intuitive and user-friendly web interface and server for IQ-TREE, an efficient phylogenetic software for maximum likelihood analysis.
Jana Trifinopoulos +3 more
semanticscholar +1 more source
Sequence locally, think globally: The Darwin Tree of Life Project
Proceedings of the National Academy of Sciences of the United States of America, 2022 The goals of the Earth Biogenome Project—to sequence the genomes of all eukaryotic life on earth—are as daunting as they are ambitious. The Darwin Tree of Life Project was founded to demonstrate the credibility of these goals and to deliver at-scale ...
The Darwin +2 more
semanticscholar +1 more source
Colourings of (k-r,k)-trees [PDF]
Opuscula Mathematica, 2017 Trees are generalized to a special kind of higher dimensional complexes known as \((j,k)\)-trees ([L. W. Beineke, R. E. Pippert, On the structure of \((m,n)\)-trees, Proc. 8th S-E Conf. Combinatorics, Graph Theory and Computing, 1977, 75-80]), and which
M. Borowiecki, H. P. Patil
doaj +1 more source