The computational time of an absolute comparison recognizer is a random variable related to a measure of computational length. These variables depend on the choice of an algorithm which carries out the recognition. The expectation and the variance of the computational length are examined in detail with reference to the probability distribution of the classes to be discriminated. In particular, upper and lower bounds of the smallest mean computational length are found in easily evaluable forms.
Computational length in pattern recognizers
VISCOLANI, BRUNO
1982
Abstract
The computational time of an absolute comparison recognizer is a random variable related to a measure of computational length. These variables depend on the choice of an algorithm which carries out the recognition. The expectation and the variance of the computational length are examined in detail with reference to the probability distribution of the classes to be discriminated. In particular, upper and lower bounds of the smallest mean computational length are found in easily evaluable forms.
File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
