๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Performances of an algorithm constructing a nearly optimal binary tree

โœ Scribed by Herman Akdag

Publisher
Springer-Verlag
Year
1983
Tongue
English
Weight
418 KB
Volume
20
Category
Article
ISSN
0001-5903

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A New Efficient Algorithm for Embedding
A New Efficient Algorithm for Embedding an Arbitrary Binary Tree into Its Optimal Hypercube
โœ Volker Heun; Ernst W. Mayr ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 250 KB

The d-dimensional binary hypercube is a very popular model of parallel computation. On the other hand, the execution of many algorithms can be represented by binary trees, making it desirable to simulate binary trees on a hypercube. In this paper, we present a simple one-to-one embedding of arbitrar

An evolutionary algorithm for constructi
An evolutionary algorithm for constructing a decision forest: Combining the classification of disjoints decision trees
โœ Lior Rokach ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 232 KB

Decision forest is an ensemble classification method that combines multiple decision trees to in a manner that results in more accurate classifications. By combining multiple heterogeneous decision trees, decision forest is effective in mitigating noise that is often prevalent in real-world classifi