|
|
Trudy Instituta Matematiki i Mekhaniki UrO RAN, 2008, Volume 14, Number 2, Pages 81–88
(Mi timm26)
|
|
|
|
This article is cited in 16 scientific papers (total in 16 papers)
Mathematical Programming
Off-line detection of a quasi-periodically recurring fragment in a numerical sequence
A. V. Kel'manov
Abstract:
The paper considers a nontraditional–combinatorial–approach to solving the problem of a posteriori (off-line) noise-proof detection of a recurring fragment in a numerical sequence. Results are presented concerning the complexity, classification, and justification of algorithms for solving discrete extremal problems to which, within the combinatorial approach, some possible variants of this problem are reduced in the case when repetitions are quasiperiodic and the noise is additive.
Received: 03.03.2008
Citation:
A. V. Kel'manov, “Off-line detection of a quasi-periodically recurring fragment in a numerical sequence”, Trudy Inst. Mat. i Mekh. UrO RAN, 14, no. 2, 2008, 81–88; Proc. Steklov Inst. Math., 263, suppl. 2 (2008), S84–S92
Linking options:
https://www.mathnet.ru/eng/timm26 https://www.mathnet.ru/eng/timm/v14/i2/p81
|
|