Implementation of arbitrary Boolean functions on a CNN Universal Machine
From MaRDI portal
Recommendations
- Robust template decomposition without weight restriction for cellular neural networks implementing arbitrary Boolean functions using support vector classifiers
- ROBUST TEMPLATE DECOMPOSITION WITH RESTRICTED WEIGHTS FOR CELLULAR NEURAL NETWORKS IMPLEMENTING AN ARBITRARY BOOLEAN FUNCTION
- REALIZATION OF BOOLEAN FUNCTIONS VIA CNN WITH VON NEUMANN NEIGHBORHOODS
- IDENTIFICATION AND REALIZATION OF LINEARLY SEPARABLE BOOLEAN FUNCTIONS VIA CELLULAR NEURAL NETWORKS
- REALIZATION AND BIFURCATION OF BOOLEAN FUNCTIONS VIA CELLULAR NEURAL NETWORKS
Cited in
(8)- UNIVERSAL CNN CELLS
- scientific article; zbMATH DE number 1294021 (Why is no real title available?)
- IDENTIFICATION AND REALIZATION OF LINEARLY SEPARABLE BOOLEAN FUNCTIONS VIA CELLULAR NEURAL NETWORKS
- REALIZATION OF BOOLEAN FUNCTIONS VIA CNN WITH VON NEUMANN NEIGHBORHOODS
- scientific article; zbMATH DE number 1281360 (Why is no real title available?)
- Robust template decomposition without weight restriction for cellular neural networks implementing arbitrary Boolean functions using support vector classifiers
- ROBUST TEMPLATE DECOMPOSITION WITH RESTRICTED WEIGHTS FOR CELLULAR NEURAL NETWORKS IMPLEMENTING AN ARBITRARY BOOLEAN FUNCTION
- Universal Perceptron Theory on Decomposition Structures of n-Bit Boolean Functions
This page was built for publication: Implementation of arbitrary Boolean functions on a CNN Universal Machine
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4246290)