Please use this identifier to cite or link to this item: https://open.uns.ac.rs/handle/123456789/12694
DC FieldValueLanguage
dc.contributor.authorNgom A.en
dc.contributor.authorStojmenović I.en
dc.contributor.authorTošić R.en
dc.date.accessioned2020-03-03T14:49:33Z-
dc.date.available2020-03-03T14:49:33Z-
dc.date.issued2001-01-01en
dc.identifier.issn13704621en
dc.identifier.urihttps://open.uns.ac.rs/handle/123456789/12694-
dc.description.abstractIn 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.ispartofNeural Processing Lettersen
dc.titleThe computing capacity of three-input multiple-valued one-threshold perceptronsen
dc.typeJournal/Magazine Articleen
dc.identifier.doi10.1023/A:1012443410163en
dc.identifier.scopus2-s2.0-0035482827en
dc.identifier.urlhttps://api.elsevier.com/content/abstract/scopus_id/0035482827en
dc.relation.lastpage155en
dc.relation.firstpage141en
dc.relation.issue2en
dc.relation.volume14en
item.grantfulltextnone-
item.fulltextNo Fulltext-
Appears in Collections:Naučne i umetničke publikacije
Show simple item record

SCOPUSTM   
Citations

1
checked on Aug 12, 2023

Page view(s)

10
Last Week
8
Last month
0
checked on May 10, 2024

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.