By Topic

The computing capacity of three-input multiple-valued one-threshold perceptrons

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Ngom, A. ; Sch. of Math. Sci., Lakehead Univ., Thunder Bay, Ont., Canada ; Stojmenovic, I. ; Tosic, R.

In this paper an exact and general formula is derived for the number of linear partitions of a given subset V ⊂ R3, depending on the configuration formed by the points of V. V can be a multi-set, that is it may contain points that coincide. Using the formula, we obtain a fast algorithm for computing the capacity of three-input k-valued one-threshold perceptrons

Published in:

Multiple-Valued Logic, 2000. (ISMVL 2000) Proceedings. 30th IEEE International Symposium on

Date of Conference: