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
Nаziv: On the number of S-threshold functions on not necessarily binary input
Аutоri: Pantović, Jovanka 
Gilezan, Silvia 
Žunić J.
Dаtum izdаvаnjа: 1-јан-2014
Čаsоpis: Proceedings of The International Symposium on Multiple-Valued Logic
Sažetak: In 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.
URI: https://open.uns.ac.rs/handle/123456789/7676
ISBN: 9781479935345
ISSN: 0195623X
DOI: 10.1109/ISMVL.2014.11
Nаlаzi sе u kоlеkciјаmа:FTN Publikacije/Publications

Prikаzаti cеlоkupа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.