Results 11 to 20 of about 2,687,568 (346)
An algebraic formalism, developped with V. Glaser and R. Stora for the study of the generalized retarded functions of quantum field theory, is used to prove a factorization theorem which provides a complete description of the generalized retarded ...
Epstein, Henri
core +5 more sources
Unimodular Trees versus Einstein Trees [PDF]
The maximally helicity violating (MHV) tree level scattering amplitudes involving three, four or five gravitons are worked out in Unimodular Gravity. They are found to coincide with the corresponding amplitudes in General Relativity.
Alvarez, Enrique+2 more
core +8 more sources
The inference of gene trees with species trees [PDF]
Molecular phylogeny has focused mainly on improving models for the reconstruction of gene trees based on sequence alignments. Yet, most phylogeneticists seek to reveal the history of species. Although the histories of genes and species are tightly linked,
Bastien Boussau+4 more
core +10 more sources
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.
A.M. Polyakov+45 more
core +4 more sources
This paper is centered on the random graph generated by a Doeblin-type coupling of discrete time processes on a countable state space whereby when two paths meet, they merge.
Baccelli, François+2 more
core +6 more sources
Canonical trees of tree-decompositions [PDF]
22 ...
Matthias Hamann+2 more
openaire +3 more sources
A suffix tree or not a suffix tree? [PDF]
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]
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
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
A numerical scheme is presented to design a lattice support for metallic components additively built via laser powder bed fusion. Results show that thermal‐induced distortion can be respectively reduced by 69%, 58%, and 50% in comparison to a uniform lattice, a fully solid support, and a truss‐based lattice support.
Jiazheng Hu+2 more
wiley +1 more source