Please use this identifier to cite or link to this item:
https://open.uns.ac.rs/handle/123456789/12694
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Ngom A. | en |
dc.contributor.author | Stojmenović I. | en |
dc.contributor.author | Tošić R. | en |
dc.date.accessioned | 2020-03-03T14:49:33Z | - |
dc.date.available | 2020-03-03T14:49:33Z | - |
dc.date.issued | 2001-01-01 | en |
dc.identifier.issn | 13704621 | en |
dc.identifier.uri | https://open.uns.ac.rs/handle/123456789/12694 | - |
dc.description.abstract | In this paper, an exact and general formula is derived for the number of linear partitions of a given point set V in three-dimensional space, depending on the configuration formed by the points of V. The set V can be a multi-set, that is it may contain points that coincide. Based on the formula, we obtain an efficient algorithm for counting the number of k-valued logic functions simulated by a three-input k-valued one-threshold perceptron. | en |
dc.relation.ispartof | Neural Processing Letters | en |
dc.title | The computing capacity of three-input multiple-valued one-threshold perceptrons | en |
dc.type | Journal/Magazine Article | en |
dc.identifier.doi | 10.1023/A:1012443410163 | en |
dc.identifier.scopus | 2-s2.0-0035482827 | en |
dc.identifier.url | https://api.elsevier.com/content/abstract/scopus_id/0035482827 | en |
dc.relation.lastpage | 155 | en |
dc.relation.firstpage | 141 | en |
dc.relation.issue | 2 | en |
dc.relation.volume | 14 | en |
item.grantfulltext | none | - |
item.fulltext | No Fulltext | - |
Appears in Collections: | Naučne i umetničke publikacije |
SCOPUSTM
Citations
1
checked on Aug 12, 2023
Page view(s)
10
Last Week
8
8
Last month
0
0
checked on May 10, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.