Skip to main content
SpringerLink
Log in

On the complexity of a search for a subset of “similar” vectors

  • Mathematics
  • Published:
Doklady Mathematics Aims and scope Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. A. V. Kel’manov, Proceedings of XIII All-Russia Conference on Mathematical Methods in Pattern Recognition, Zelenogorsk, Leningrad oblast, September 30–October 6, 2007 (MAKS, Moscow, 2007).

    Google Scholar 

  2. A. V. Kel’manov and B. A. Jeon, IEEE Trans. Signal Processing 52(3), 1–12 (2004).

    Article  MathSciNet  Google Scholar 

  3. A. Wald, Sequential Analysis (Wiley, New York, 1947).

    MATH  Google Scholar 

  4. C. W. Helstrom, Elements of Signal Detection and Estimation (Prentice-Hall, Englewood Cliffs, N.J., 1979).

    Google Scholar 

  5. B. D. Anderson and J. D. Moore, Optimal Filtering (Prentice-Hall, Englewood Cliffs, N.J., 1995).

    Google Scholar 

  6. I. V. Nikiforov, Sequential Change-Point Detection (Nauka, Moscow, 1983) [in Russian].

    Google Scholar 

  7. A. A. Zhiglyavskii and A. E. Kraskovskii, Change-Point Detection in Radio Engineering (Leningr. Gos. Univ., Leningrad, 1988) [in Russian].

    Google Scholar 

  8. N. Kligene and L. Telksnis, Avtom. Telemekh., No. 10, 5–56 (1983).

  9. F. Gini, A. Farina, and M. Greco, IEEE Trans. Aerospace Electron. Syst. 37, 329–359 (2001).

    Article  Google Scholar 

  10. E. Kh. Gimadi, A. V. Kel’manov, M. A. Kel’manova, and S. A. Khamidullin, Sib. Zh. Ind. Mat. 9(1), 55–74 (2006).

    MathSciNet  Google Scholar 

  11. A. V. Kel’manov and S. A. Khamidullin, Comput. Math. Math. Phys. 41, 762–774 (2001) [Zh. Vychisl. Mat. Mat. Fiz. 41, 807–820 (2001)].

    MATH  MathSciNet  Google Scholar 

  12. A. V. Kel’manov, S. A. Khamidullin, and L. V. Okol’nishnikova, Pattern Recogn. Image Anal. 12, 438–447 (2002).

    Google Scholar 

  13. A. E. Baburin, E. Kh. Gimadi, N. I. Glebov, and A. V. Pyatkin, Diskret. Anal. Issled. Operatsii, Ser. 2 14 (1), 32–42 (2007).

    MathSciNet  Google Scholar 

  14. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, San Francisco, Calif., 1979).

    MATH  Google Scholar 

  15. P. Brucker, Lect. Notes Econ. Math. Syst. 157, 45–54 (1978).

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Sobolev Institute of Mathematics, Siberian Branch, Russian Academy of Sciences, pr. Akademika Koptyuga 4, Novosibirsk, 630090, Russia

    A. V. Kel’manov & A. V. Pyatkin

Authors
  1. A. V. Kel’manov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. V. Pyatkin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to A. V. Kel’manov.

Additional information

Original Russian Text © A.V. Kel’manov, A.V. Pyatkin, 2008, published in Doklady Akademii Nauk, 2008, Vol. 421, No. 5, pp. 590–592.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kel’manov, A.V., Pyatkin, A.V. On the complexity of a search for a subset of “similar” vectors. Dokl. Math. 78, 574–575 (2008). https://doi.org/10.1134/S1064562408040273

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S1064562408040273

Keywords

Search

Navigation