Results 61 to 70 of about 744,531 (188)
Label-based parameters in increasing trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 Grown simple families of increasing trees are a subclass of increasing trees, which can be constructed by an insertion process. Three such tree families contained in the grown simple families of increasing trees are of particular interest: $\textit ...
Markus Kuba, Alois Panholzer
doaj +1 more source
Journal of Computing and Information Technology, 2023 With the advancement of the university information process, more and more application systems are running on the campus network, and the information system becomes larger and more complex. With the rapid growth of network users and the popularization and
Li Yin, Yijun Chen
doaj +1 more source
The fluctuations of the giant cluster for percolation on random split trees
, 2019 A split tree of cardinality $n$ is constructed by distributing $n$ "balls" in a subset of vertices of an infinite tree which encompasses many types of random trees such as $m$-ary search trees, quad trees, median-of-$(2k+1)$ trees, fringe-balanced trees,
Berzunza, Gabriel +2 more
core +1 more source
Discrete Applied Mathematics, 2019 Let $T$ be a random tree taken uniformly at random from the family of labelled trees on $n$ vertices. In this note, we provide bounds for $c(n)$, the number of sub-trees of $T$ that hold asymptotically almost surely. With computer support we show that $1.41805386^n \le c(n) \le 1.41959881^n$. Moreover, there is a strong indication that, in fact, $c(n) \
Bogumił Kamiński, Paweł Prałat
openaire +2 more sources
Random Planar Lattices and Integrated SuperBrownian Excursion [PDF]
, 2002 In this paper, a surprising connection is described between a specific brand of random lattices, namely planar quadrangulations, and Aldous' Integrated SuperBrownian Excursion (ISE).
A Dembo +18 more
core +5 more sources
Classification of Alpine Skiing Styles Using GNSS and Inertial Measurement Units
Sensors, 2020 In alpine skiing, four commonly used turning styles are snowplow, snowplow-steering, drifting and carving. They differ significantly in speed, directional control and difficulty to execute.
Christina Neuwirth +5 more
doaj +1 more source
Width and mode of the profile for some random trees of logarithmic height
, 2006 We propose a new, direct, correlation-free approach based on central moments of profiles to the asymptotics of width (size of the most abundant level) in some random trees of logarithmic height.
Devroye, Luc, Hwang, Hsien-Kuei
core +1 more source
IEEE Access, 2022 We propose a new ML model called Topological Forest that contains an ensemble of decision trees. Unlike a vanilla Random Forest, Topological Forest has a special training process that selects a smaller number of decision trees on a topological graph ...
Murat Ali Bayir +3 more
doaj +1 more source
Non-crossing trees revisited: cutting down and spanning subtrees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2003 Here we consider two parameters for random non-crossing trees: $\textit{(i)}$ the number of random cuts to destroy a size-$n$ non-crossing tree and $\textit{(ii)}$ the spanning subtree-size of $p$ randomly chosen nodes in a size-$n$ non-crossing tree ...
Alois Panholzer
doaj +1 more source
Holonomic equations and efficient random generation of binary trees [PDF]
Discrete Mathematics & Theoretical Computer ScienceHolonomic equations are recursive equations which allow computing efficiently numbers of combinatoric objects. Rémy showed that the holonomic equation associated with binary trees yields an efficient linear random generator of binary trees.
Pierre Lescanne
doaj +1 more source