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/16095
Nаziv: | Separating points by parallel hyperplanes-characterization problem | Аutоri: | Gilezan, Silvia Pantović, Jovanka Žunić J. |
Dаtum izdаvаnjа: | 1-сеп-2007 | Čаsоpis: | IEEE Transactions on Neural Networks | Sažetak: | This paper deals with partitions of a discrete set S of points in a d-dimensional space, by h parallel hyperplanes. Such partitions are in a direct correspondence with multilinear threshold functions which appear in the theory of neural networks and multivalued logic. The characterization (encoding) problem is studied. We show that a unique characterization (encoding) of such multilinear partitions of S = {0, 1,..., m -1}d is possible within O(h · d2 · log m) bit rate per encoded partition. The proposed characterization (code) consists of (d+1) · (h+1) discrete moments having the order no bigger than 1. The obtained bit rate is evaluated depending on the mutual relations between h; d, and m. The optimality is reached in some cases. © 2007 IEEE. | URI: | https://open.uns.ac.rs/handle/123456789/16095 | ISSN: | 10459227 | DOI: | 10.1109/TNN.2007.891678 |
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а
13
prоvеrеnо 03.05.2024.
Prеglеd/i stаnicа
65
Prоtеklа nеdеljа
15
15
Prоtеkli mеsеc
0
0
prоvеrеnо 03.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.