Robust Template Decomposition without Weight Restriction  for Cellular Neural Networks Implementing Arbitrary Boolean Functions Using Support Vector Classifiers

<table>Boolean function of Example <a href="https://static.hindawi.com/articles/mpe/volume-2013/614543/figures/#ex2">2</a>.</table>

Mathematical Problems in Engineering

fig2

Figure 2

Figure 2: Robust Template Decomposition without Weight Restriction  for Cellular Neural Networks Implementing Arbitrary Boolean Functions Using Support Vector Classifiers 

Figure 2 | Robust Template Decomposition without Weight Restriction  for Cellular Neural Networks Implementing Arbitrary Boolean Functions Using Support Vector Classifiers 