Individual structural parameters of trees, such as forest stand tree height and biomass, serve the foundation for monitoring dynamic changes in resources. are closely related to individual crown segmentation. Although three-dimensional (3D) data have been successfully used determine segmentation, this phenomenon is influenced by various factors, (i) source 3D data, (ii) segmentation algorithm, ...

The prediction of the ultimate bearing capacity of the pile under axial load is one of the important issues for many researches in the field of geotechnical engineering. In recent years, the use of computational intelligence techniques such as different methods of artificial neural network has been developed in terms of physical and numerical modeling aspects. In this study, a database of 100 p...

It is well-known that, given inorder traversal along with one of the preorder or postorder traversals of a binary tree, the tree can be determined uniquely. Several algorithms have been proposed to reconstruct a binary tree from its inorder and preorder traversals. There is one study to reconstruct a binary tree from its inorder and postorder traversals, and this algorithm takes running time of...

Univariate decision tree algorithms are widely used in Data Mining because (i) they are easy to learn (ii) when trained they can be expressed in rule based manner. In several applications mainly including Data Mining, the dataset to be learned is very large. In those cases it is highly desirable to construct univariate decision trees in reasonable time. This may be accomplished by parallelizing...

Tree pattern matching (tpm) algorithms play an important role in practical applications such as compilers and XML document validation. Many tpm algorithms based on tree automata have appeared in the literature. For reasons of efficiency, these automata are preferably deterministic. Deterministic root-to-frontier tree automata (drftas) are less powerful than nondeterministic ones, and no root-to...

Abstra t. Tree pattern mat hing (tpm) algorithms play an important role in pra ti al appli ations su h as ompilers and XML do ument validation. Many tpm algorithms based on tree automata have appeared in the literature. For reasons of eÆ ien y, these automata are preferably deterministi . Deterministi root-to-frontier tree automata (drftas) are less powerful than nondeterministi ones, and no ro...

The capacitated minimum spanning tree (CMST) problem is to 3nd a minimum cost spanning tree in a network where nodes have speci3ed demands, with an additional capacity constraints on the subtrees incident to a given source node s. The capacitated minimum spanning tree problem arises as an important subproblem in many telecommunication network design problems. In a recent paper, Ahuja et al. (Ma...

This research work is concerned with the predictability of ensemble and singular tree-based machine learning algorithms during recession prosperity two companies listed in Tehran Stock Exchange context big data. In this regard, main issue that economic managers academic community require predicting models more accuracy reduced execution time; moreover, prediction stock market highly significant...