Abstract:
A polynomial-time algorithm is designed for finding an optimal solution of a discrete optimization problem to which a pattern recognition problem is reduced, namely, the noise-proof recognition of a sequence as a structure consisting of contiguous subsequences in the form of series of identical nonzero vectors from an alphabet of vectors in the Euclidean space that alternate with zero vectors.
Key words:discrete optimization problem, polynomial-time algorithm, noise-proof recognition, vector sequence, Euclidean space, series of identical vectors.