|
Recognition of a sequence as a structure containing series of recurring vectors from an alphabet
A. V. Kel'manov, L. V. Mikhailova Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences, Novosibirsk
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.
Received: 27.12.2012
Citation:
A. V. Kel'manov, L. V. Mikhailova, “Recognition of a sequence as a structure containing series of recurring vectors from an alphabet”, Zh. Vychisl. Mat. Mat. Fiz., 53:7 (2013), 1212–1224; Comput. Math. Math. Phys., 53:7 (2013), 1044–1055
Linking options:
https://www.mathnet.ru/eng/zvmmf9833 https://www.mathnet.ru/eng/zvmmf/v53/i7/p1212
|
Statistics & downloads: |
Abstract page: | 268 | Full-text PDF : | 71 | References: | 54 | First page: | 8 |
|