Results 51 to 60 of about 258,206 (308)
J. Mach. Learn. Res., 2013 Finding interactions between variables in large and high-dimensional datasets is often a serious computational challenge. Most approaches build up interaction sets incrementally, adding variables in a greedy fashion. The drawback is that potentially informative high-order interactions may be overlooked.
Shah, RD, Meinshausen, N
openaire +4 more sources
, 2023 This paper proposes a random tree algorithm based on a potential field oriented greedy strategy for the path planning of unmanned aerial vehicles (UAVs).
Haoqi Guo +4 more
core +1 more source
Automorphisms of Random Trees.
, 2022 We study the size of the automorphism group of two different types of random trees: Galton-Watson trees and Pólya trees. In both cases, we prove that it asymptotically follows a log-normal distribution. While the proof for Galton-Watson trees mainly relies on probabilistic arguments and a general result on additive tree functionals, generating ...
Olsson, Christoffer, Wagner, Stephan
openaire +3 more sources
The human gut microbiome across the life course
FEBS Letters, EarlyView.Despite significant individual variation and continuous change throughout life, the human gut microbiome follows some life stage‐specific trends. This article provides a brief overview of how gut microbiome composition shifts across different phases of life. Created in BioRender. Özkurt, E. (2026) https://BioRender.com/8q4nrnc.
Alise J. Ponsero +4 more
wiley +1 more source
Empirical distribution of random tree scores.
, 2013 Ten thousand random matrices were created from the matrix used to create the sample dendrogram in Figure 1 by randomly rearranging the peptide intensity values within each sample. For each score that was given to at least one random tree, the frequency
Brett Trost (140006) +4 more
core +1 more source
Discrete Mathematics, 1983 The probability space consisting of all graphs on a set of \(n\) vertices where each edge occurs with probability \(p\), independently of all other edges, is denoted by \(G(n,p)\). Theorem: For each \(\epsilon>0\) almost every graph \(G\in G(n,p)\) is such if \((1+\epsilon)\log n/\log ...
Paul Erdös, Zbigniew Palka
openaire +1 more source
Structural insights and therapeutic targets in Acinetobacter baumannii capsule biosynthesis
FEBS Letters, EarlyView.Hypervirulent KL49 A. baumannii's capsular polysaccharide contains the nonulosonic acid 8‐epi‐Leg5,7Ac2, synthesized by epimerization via ElaA, ElaB, and ElaC. Crystal structures of ElaA, ElaB, and ElaC reveal their role in CMP‐Leg5,7Ac2 synthesis and regioselective C8 epimerization.
Woo Cheol Lee +7 more
wiley +1 more source
Spectral asymptotics for stable trees [PDF]
, 2010 We calculate the mean and almost-sure leading order behaviour of the high frequency asymptotics of the eigenvalue counting function associated with the natural Dirichlet form on alpha-stable trees, which lead in turn to short-time heat kernel asymptotics
Croydon, David A., Hambly, Ben M.
core
Self-similarity and spectral asymptotics for the continuum random tree
, 2008 We use the random self-similarity of the continuum random tree to show that it is homeomorphic to a post-critically finite self-similar fractal equipped with a random self-similar metric.
Croydon, David A. +5 more
core +1 more source
A new generation tree for permutations, preserving the number of fixed points [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 We describe a new uniform generation tree for permutations with the specific property that, for most permutations, all of their descendants in the generation tree have the same number of fixed points.
Philippe Duchon, Romaric Duvignau
doaj +1 more source