𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Decision Trees with Boolean Threshold Queries

✍ Scribed by Y. Benasher; I. Newman

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
765 KB
Volume
51
Category
Article
ISSN
0022-0000

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Arthur–Merlin Games in Boolean Decision
Arthur–Merlin Games in Boolean Decision Trees
✍ Ran Raz; GΓ‘bor Tardos; Oleg Verbitsky; Nikolai Vereshchagin πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 253 KB

It is well known that probabilistic boolean decision trees cannot be much more powerful than deterministic ones (N. Nisan, SIAM J. Comput. 20, No. 6 (1991), 999 1007). Motivated by a question if randomization can significantly speed up a nondeterministic computation via a boolean decision tree, we a

Decision trees with optimal joint partit
Decision trees with optimal joint partitioning
✍ Djamel A. Zighed; Gilbert Ritschard; Walid Erray; Vasile-Marian Scuturici πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 544 KB

Decision tree methods generally suppose that the number of categories of the attribute to be predicted is fixed. Breiman et al., with their Twoing criterion in CART, considered gathering the categories of the predicted attribute into two supermodalities. In this article, we propose an extension of t

BER analysis of synchronous fiber-optic
BER analysis of synchronous fiber-optic CDMA networks with suboptimal decision threshold
✍ Ching-Chih Kuo; Jyh-Horng Wu πŸ“‚ Article πŸ“… 2002 πŸ› John Wiley and Sons 🌐 English βš– 106 KB

## Abstract The bit‐error rate (BER) of synchronous optical CDMA networks with a fixed (suboptimal) decision threshold is derived. The strategy used offers the advantage that the network need not dynamically monitor the number of users. The numerical results are satisfactory when compared with prev