Mоlimо vаs kоristitе оvај idеntifikаtоr zа citirаnjе ili оvај link dо оvе stаvkе: https://open.uns.ac.rs/handle/123456789/7676
Pоljе DC-аVrеdnоstЈеzik
dc.contributor.authorPantović, Jovankaen_US
dc.contributor.authorGilezan, Silviaen_US
dc.contributor.authorŽunić J.en_US
dc.date.accessioned2019-09-30T09:03:37Z-
dc.date.available2019-09-30T09:03:37Z-
dc.date.issued2014-01-01-
dc.identifier.isbn9781479935345en_US
dc.identifier.issn0195623Xen_US
dc.identifier.urihttps://open.uns.ac.rs/handle/123456789/7676-
dc.description.abstractIn this paper we consider S-threshold functions defined on not necessarily binary input. By S-threshold function, in an arbitrary dimension we mean a function which can be written as a linear combination of monomials from a predefined set. First, we determine sets of discrete moments which uniquely determine such functions. Based on these, we derive a generic formula for the upper bound of the functions considered. The formula is generic because it works in all dimensions, on any input size, and for any set of monomials used to define certain S-threshold function. Even though the formula is very generic it gives some improvements of the well-known results. © 2014 IEEE.en_US
dc.relation.ispartofProceedings of The International Symposium on Multiple-Valued Logicen_US
dc.titleOn the number of S-threshold functions on not necessarily binary inputen_US
dc.typeConference Paperen_US
dc.identifier.doi10.1109/ISMVL.2014.11-
dc.identifier.scopus2-s2.0-84904461722-
dc.identifier.urlhttps://api.elsevier.com/content/abstract/scopus_id/84904461722-
dc.description.versionUnknownen_US
dc.relation.lastpage18en_US
dc.relation.firstpage13en_US
item.fulltextNo Fulltext-
item.grantfulltextnone-
crisitem.author.deptDepartman za opšte discipline u tehnici-
crisitem.author.deptDepartman za opšte discipline u tehnici-
crisitem.author.orcid0000-0003-2253-8285-
crisitem.author.parentorgFakultet tehničkih nauka-
crisitem.author.parentorgFakultet tehničkih nauka-
Nаlаzi sе u kоlеkciјаmа:FTN Publikacije/Publications
Prikаzаti јеdnоstаvаn zаpis stаvki

SCOPUSTM   
Nаvоđеnjа

3
prоvеrеnо 10.05.2024.

Prеglеd/i stаnicа

39
Prоtеklа nеdеljа
11
Prоtеkli mеsеc
0
prоvеrеnо 10.05.2024.

Google ScholarTM

Prоvеritе

Аlt mеtrikа


Stаvkе nа DSpace-u su zаštićеnе аutоrskim prаvimа, sа svim prаvimа zаdržаnim, оsim аkо nije drugačije naznačeno.