نتایج جستجو برای: bucket recursive trees
تعداد نتایج: 119534 فیلتر نتایج به سال:
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...
Simple families of increasing trees can be constructed from simply generated tree families, if one considers for every tree of size n all its increasing labellings, i.e., labellings of the nodes by distinct integers of the set {1, . . . , n} in such a way that each sequence of labels along any branch starting at the root is increasing. Three such tree families are of particular interest: recurs...
Bona [6] studied the distribution of ascents, plateaux and descents in the class of Stirling permutations, introduced by Gessel and Stanley [14]. Recently, Janson [18] showed the connection between Stirling permutations and plane recursive trees and proved a joint normal law for the parameters considered by Bona. Here we will consider generalized Stirling permutations extending the earlier resu...
We count the numbers of independent dominating sets of rooted labeled trees, ordinary labeled trees, and recursive trees, respectively.
The Wiener index has been studied for simply generated random trees, non-plane unlabeled random trees and a huge subclass of random grid trees containing random binary search trees, random medianof-(2k+ 1) search trees, random m-ary search trees, random quadtrees, random simplex trees, etc. An important class of random grid trees for which the Wiener index was not studied so far are random digi...
We present a linear time c-planarity testing and embedding algorithm for c-connected clustered graphs. The algorithm is based on a characterization of the clustered planarity given in a companion paper [3]. The algorithm is reasonably easy to implement, since it exploits as building blocks simple algorithmic tools like the computation of lowest common ancestors, of minimum and maximum spanning ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید