Off-line detection of a quasi-periodically recurring fragment in a numerical sequence

DOI10.1134/S0081543808060096zbMath1180.93099OpenAlexW2090086562MaRDI QIDQ735649

Alexander Kel'Manov

Publication date: 23 October 2009

Published in: Proceedings of the Steklov Institute of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0081543808060096

zbMATH Keywords

discrete extremal problemsnoise-proof detection

Mathematics Subject Classification ID

Estimation and detection in stochastic control theory (93E10) Signal detection and filtering (aspects of stochastic processes) (60G35) Detection theory in information and communication theory (94A13)

Related Items (6)

Fully polynomial-time approximation scheme for a special case of a quadratic Euclidean 2-clustering problem ⋮ An exact pseudopolynomial algorithm for a problem of the two-cluster partitioning of a set of vectors ⋮ A fully polynomial-time approximation scheme for a sequence 2-cluster partitioning problem ⋮ A randomized algorithm for a sequence 2-clustering problem ⋮ An approximation polynomial-time algorithm for a sequence bi-clustering problem ⋮ A randomized algorithm for two-cluster partition of a set of vectors

Cites Work

• A Posteriori Joint Detection and Discrimination of Pulses in a Quasiperiodic Pulse Train
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Off-line detection of a quasi-periodically recurring fragment in a numerical sequence