P. L Hammer, T. Ibaraki and U. N. Peled. Threshold numbers and threshold completions. Annals of Discrete Mathematics 11, 1981: 125--145. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Analysis of Data with Threshold Decision Lists - Martin Anthony December Self-citation (Threshold) (Correct)
....results one in which all terms are of the form (f i ; 1) But such a decision list is quite simply the disjunction f 1 f 2 : where means or . For Boolean functions, the problem of decomposing a function into the disjunction of threshold functions has been considered by Hammer et al. [14] and Zuev [29] Hammer et al. defined the threshold number of a Boolean function to be the minimum s such that f is a disjunction of s threshold functions, and they showed that there is an increasing function with threshold number n=2 =n. A function is increasing if, when f(x) 1 and x i = ....
P. L Hammer, T. Ibaraki and U. N. Peled. Threshold numbers and threshold completions. Annals of Discrete Mathematics 11, 1981: 125--145.
Decision Lists and Threshold Decision Lists - Martin Anthony December Self-citation (Threshold) (Correct)
....form of decision list results one in which all terms are of the form (f i , 1) But, as we saw earlier, such a decision list is quite simply the disjunction f 1 . The problem of decomposing a function into the disjunction of threshold functions has been considered also by Hammer et al. [11] and Zuev [22] Hammer et al. defined the threshold number of a Boolean function to be the minimum s such that f is a disjunction of s threshold functions, and they showed that there is a positive function with threshold number n. Zuev [22] showed that almost all positive functions have ....
P. L Hammer, T. Ibaraki and U. N. Peled. Threshold numbers and threshold completions. Annals of Discrete Mathematics 11, 1981: 125--145.
Boolean Functions and Artificial Neural Networks - Martin Anthony Department (Correct)
No context found.
P. L Hammer, T. Ibaraki and U. N. Peled. Threshold numbers and threshold completions. Annals of Discrete Mathematics 11, 1981: 125--145.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC