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

DOI10.1134/S0081543808060096zbMATH Open1180.93099OpenAlexW2090086562MaRDI QIDQ735649FDOQ735649

Authors: A. V. 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

Recommendations

• A posteriori detection of a quasiperiodic fragment with a given number of repetitions in a numerical sequence
• scientific article; zbMATH DE number 5066530
• scientific article
• scientific article; zbMATH DE number 2102667
• scientific article; zbMATH DE number 2010037
• scientific article
• Recognition of a numerical sequence that includes series of quasiperiodically repeating standard fragments
• scientific article; zbMATH DE number 1985640
• Optimal detection of a recurring tuple of reference fragments in a quasiperiodic sequence
• scientific article; zbMATH DE number 1979633

zbMATH Keywords

discrete extremal problemsnoise-proof detection

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• A Posteriori Joint Detection and Discrimination of Pulses in a Quasiperiodic Pulse Train
• Title not available (Why is that?)

Cited In (9)

• A randomized algorithm for two-cluster partition of a set of vectors
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Fully polynomial-time approximation scheme for a special case of a quadratic Euclidean 2-clustering problem
• A fully polynomial-time approximation scheme for a sequence 2-cluster partitioning problem
• An exact pseudopolynomial algorithm for a problem of the two-cluster partitioning of a set of vectors
• An approximation polynomial-time algorithm for a sequence bi-clustering problem
• A randomized algorithm for a sequence 2-clustering problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q735649)