Results 51 to 60 of about 736,356 (194)
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
Identification of representative trees in random forests based on a new tree-based distance measure [PDF]
, 2022 Björn‐Hergen Laabs +2 more
openalex +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
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
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
Degree distribution of random Apollonian network structures and Boltzmann sampling [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 Random Apollonian networks have been recently introduced for representing real graphs. In this paper we study a modified version: random Apollonian network structures (RANS), which preserve the interesting properties of real graphs and can be handled ...
Alexis Darrasse, Michèle Soria
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
Disassortativity of random critical branching trees
, 2009 Random critical branching trees (CBTs) are generated by the multiplicative branching process, where the branching number is determined stochastically, independent of the degree of their ancestor.
Kahng, B., Kim, D., Kim, J. S.
core +1 more source
, 2018 We consider infinite Galton-Watson trees without leaves together with i.i.d.~random variables called marks on each of their vertices. We define a class of flow rules on marked Galton-Watson trees for which we are able, under some algebraic assumptions ...
Rousselin, Pierre
core +2 more sources
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