Results 31 to 40 of about 246,128 (313)
Expected size of a tree in the fixed point forest [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 We study the local limit of the fixed-point forest, a tree structure associated to a simple sorting algorithm on permutations. This local limit can be viewed as an infinite random tree that can be constructed from a Poisson point process configuration on
Samuel Regan, Erik Slivken
doaj +1 more source
Simply generated trees, conditioned Galton―Watson trees, random allocations and condensation: Extended abstract [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 We give a unified treatment of the limit, as the size tends to infinity, of random simply generated trees, including both the well-known result in the standard case of critical Galton-Watson trees and similar but less well-known results in the other ...
Svante Janson
doaj +1 more source
Selection of Random Minimum Spanning Tree Based on Intuitionistic Fuzzy Sets [PDF]
Jisuanji gongcheng, 2016 To solve the difficulty of selecting nodes for network topology in complex environment,a selection method of random minimum spanning tree based on intuitionistic fuzzy sets is proposed.Through analyzing the uncertainty,like randomness and fuzziness ...
WANG Xiaoxia,YANG Fengbao,YUAN Hua
doaj +1 more source
Mathematics of Operations Research, 1984 A widely used class of binary trees is studied in order to provide information useful in evaluating algorithms based on this storage structure. A closed form counting formula for the number of binary trees with n nodes and height k is developed and restated as a recursion more useful computationally. A generating function for the number of nodes given
Brown, Gerald G., Shubert, Bruno O.
openaire +2 more sources
Large Deviations for Random Trees [PDF]
Journal of Statistical Physics, 2008 10 ...
Bakhtin, Yuri, Heitsch, Christine
openaire +4 more sources
ESAIM: Proceedings, 2011 These notes provide an elementary and self-contained introduction to branching ran- dom walks. Section 1 gives a brief overview of Galton-Watson trees, whereas Section 2 presents the classical law of large numbers for branching random walks. These two short sections are not exactly in- dispensable, but they introduce the idea of using size-biased trees,
openaire +2 more sources
CLASSIFICATION OF ORCHARD CROP USING SENTINEL-1A SYNTHETIC APERTURE RADAR DATA [PDF]
The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences, 2018 A study was conducted in Saharanpur District of Uttar Pradesh to asses the potential of Sentinel-1A SAR Data in orchard crop classification. The objective of the study was to evaluate three different classifiers that are maximum likelihood classifier ...
H. Sahu, D. Haldar, A. Danodia, S. Kumar
doaj +1 more source
Unsupervised Extremely Randomized Trees [PDF]
, 2018 In this paper we present a method to compute dissimilarities on unlabeled data, based on extremely randomized trees. This method, Unsupervised Extremely Randomized Trees, is used jointly with a novel randomized labeling scheme we describe here, and that we call AddCl3.
Dalleau, Kevin +2 more
openaire +2 more sources
MathematicsRoad traffic accident severity prediction is crucial for implementing effective safety measures and proactive traffic management strategies. Existing methods often treat this as a nominal classification problem and use traditional feature selection ...
Bita Ghasemkhani +3 more
doaj +1 more source