Results 11 to 20 of about 3,999,163 (365)
Nuclear Physics B, 2016 minor corrections, references added, no change in ...
Epstein, Henri
openaire +5 more sources
Unimodular trees versus Einstein trees [PDF]
The European Physical Journal C, 2016 20 pages, 5 ...
Álvarez, Enrique +2 more
openaire +9 more sources
Physical Review E, 2003 We discuss the scaling properties of free branched polymers. The scaling behaviour of the model is classified by the Hausdorff dimensions for the internal geometry: d_L and d_H, and for the external one: D_L and D_H. The dimensions d_H and D_H characterize the behaviour for long distances while d_L and D_L for short distances. We show that the internal
Burda, Z +3 more
openaire +5 more sources
The Inference of Gene Trees with Species Trees [PDF]
Systematic Biology, 2014 Review article in relation to the "Mathematical and Computational Evolutionary Biology" conference, Montpellier ...
Bastien Boussau +7 more
openaire +12 more sources
Canonical trees of tree-decompositions [PDF]
Journal of Combinatorial Theory, Series B, 2022 22 ...
Matthias Hamann +2 more
openaire +3 more sources
A suffix tree or not a suffix tree? [PDF]
Journal of Discrete Algorithms, 2015 In this paper we study the structure of suffix trees. Given an unlabeled tree $ $ on $n$ nodes and suffix links of its internal nodes, we ask the question "Is $ $ a suffix tree?", i.e., is there a string $S$ whose suffix tree has the same topological structure as $ $?
Starikovskaya, Tatiana A. +1 more
openaire +5 more sources
Tree compression with top trees [PDF]
Information and Computation, 2013 We introduce a new compression scheme for labeled trees based on top trees. Our compression scheme is the first to simultaneously take advantage of internal repeats in the tree (as opposed to the classical DAG compression that only exploits rooted subtree repeats) while also supporting fast navigational queries directly on the compressed representation.
Bille, Philip +3 more
openaire +5 more sources
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
Pairs of trees in tree–tree triangulations
Discrete Mathematics, 2007 AbstractA triangulation T of a compact 2-manifold is said to be a tree–tree triangulation if the graph of T can be partitioned into two induced trees. Hence each tree–tree triangulation is a triangulation of the 2-sphere. Recognizing tree–tree triangulations among all simple spherical ones can be seen to be an NP-complete problem.
Günter Schaar, Zdzisław Skupień
openaire +2 more sources
CGIAR Research Program on Forests, Trees and Agroforestry - Plan of Work and Budget 2020 [PDF]
, 2020 There were no significant changes in 2019 to FTA’s theory of change1. FTA plans all its work on the basis of its operational priorities. These, in turn, focusresearch towards major development demands and knowledge gaps, orienting FTA towards the ...
CGIAR Research Program on Forests, Trees and Agroforestry
core +1 more source