نتایج جستجو برای: random recursive trees
تعداد نتایج: 392516 فیلتر نتایج به سال:
We study weighted path lengths (depths) and distances for increasing tree families. For those subclasses of increasing tree families, which can be constructed via an insertion process, e.g., recursive trees, plane-oriented recursive trees and binary increasing trees, we can determine the limiting distribution which can be characterized as a generalized Dickman’s infinitely divisible distribution.
We survey multivariate limit theorems in the framework of the contraction method for recursive sequences as arising in the analysis of algorithms, random trees or branching processes. We compare and improve various general conditions under which limit laws can be obtained, state related open problems and given applications to the analysis of algorithms and branching recurrences. AMS subject cla...
Simply generated families of trees are described by the equation T (z) = φ(T (z)) for their generating function. If a tree has n nodes, we say that it is increasing if each node has a label ∈ {1, . . . , n}, no label occurs twice, and whenever we proceed from the root to a leaf, the labels are increasing. This leads to the concept of simple families of increasing trees. Three such families are ...
Deep Learning models enjoy considerable success in Natural Language Processing. While deep architectures produce useful representations that lead to improvements in various tasks, they are often difficult to interpret. This makes the analysis of learned structures particularly difficult. In this paper, we rely on empirical tests to see whether a particular structure makes sense. We present an a...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید