ROBUST TEMPLATE DECOMPOSITION WITH RESTRICTED WEIGHTS FOR CELLULAR NEURAL NETWORKS IMPLEMENTING AN ARBITRARY BOOLEAN FUNCTION
From MaRDI portal
(Redirected from Publication:3498775)
Recommendations
- Robust template decomposition without weight restriction for cellular neural networks implementing arbitrary Boolean functions using support vector classifiers
- Implementation of arbitrary Boolean functions on a CNN Universal Machine
- REALIZATION OF BOOLEAN FUNCTIONS VIA CNN WITH VON NEUMANN NEIGHBORHOODS
- Robustness design of logic not translation CNN
- REALIZATION AND BIFURCATION OF BOOLEAN FUNCTIONS VIA CELLULAR NEURAL NETWORKS
Cites work
- An analytic method for designing simple cellular neural networks
- Cellular neural networks: theory
- Designing cellular neural networks for the evaluation of local Boolean functions
- scientific article; zbMATH DE number 1391397 (Why is no real title available?)
- Implementation of arbitrary Boolean functions on a CNN Universal Machine
- The CNN universal machine: an analogic array computer
Cited in
(6)- The influence of the boundary conditions on the robustness of a CNN
- Implementation of arbitrary Boolean functions on a CNN Universal Machine
- Template design methods for binary stable cellular neural networks
- Robust template decomposition without weight restriction for cellular neural networks implementing arbitrary Boolean functions using support vector classifiers
- A configurable digital cellular neural network with template decomposition
- Robustness design of logic not translation CNN
This page was built for publication: ROBUST TEMPLATE DECOMPOSITION WITH RESTRICTED WEIGHTS FOR CELLULAR NEURAL NETWORKS IMPLEMENTING AN ARBITRARY BOOLEAN FUNCTION
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3498775)
