2009 International Conference on Computer Engineering and Technology 2009
DOI: 10.1109/iccet.2009.201
|View full text |Cite
|
Sign up to set email alerts
|

Behavioral Fault Model for Neural Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
5
0

Year Published

2010
2010
2013
2013

Publication Types

Select...
2
2
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(5 citation statements)
references
References 5 publications
0
5
0
Order By: Relevance
“…In our MPE formulae, the complexity of the direct calcula- 1 Since the number M of nodes is usually less than the number N of training samples, the complexity is equal to O(M × N). 1 Although the computational cost of Tr (29) and (36), becomes non-diagonal in the eigen domain of H φ .…”
Section: Complexity Of Mpe Formulaementioning
confidence: 99%
See 3 more Smart Citations
“…In our MPE formulae, the complexity of the direct calcula- 1 Since the number M of nodes is usually less than the number N of training samples, the complexity is equal to O(M × N). 1 Although the computational cost of Tr (29) and (36), becomes non-diagonal in the eigen domain of H φ .…”
Section: Complexity Of Mpe Formulaementioning
confidence: 99%
“…1 Although the computational cost of Tr (29) and (36), becomes non-diagonal in the eigen domain of H φ . Hence, the complexity is equal to O(M × N + M 2 ).…”
Section: Complexity Of Mpe Formulaementioning
confidence: 99%
See 2 more Smart Citations
“…Ahmadi et al proposed a behavioral fault model in [8] for neural networks. Authors took advantage of inherent properties of neural network in error masking and made the fault model in an abstract level corresponding to the neural graph.…”
Section: Introductionmentioning
confidence: 99%