On the complexity of a search for a subset of “similar” vectors-Reference-Cited by-同舟云学术

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

Published:2008-08 Issue:1 Volume:78 Page:574-575
ISSN:1064-5624
Container-title:Doklady Mathematics
language:en
Short-container-title:Dokl. Math.

Author:

Kel’manov A. V.,Pyatkin A. V.

Publisher

Pleiades Publishing Ltd

Subject

General Mathematics

Link

http://link.springer.com/content/pdf/10.1134/S1064562408040273.pdf

Reference15 articles.

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).

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

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

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

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

Cited by 27 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. PTAS for Problems of Vector Choice and Clustering with Various Centers;Journal of Applied and Industrial Mathematics;2023-09

2. 1-mean and 1-medoid 2-clustering problem with arbitrary cluster sizes: Complexity and approximation;Yugoslav Journal of Operations Research;2023

3. PTAS for p-Means q-Medoids r-Given Clustering Problem;Mathematical Optimization Theory and Operations Research;2023

4. NP-Hardness of 1-Mean and 1-Medoid 2-Clustering Problem with Arbitrary Clusters Sizes;Communications in Computer and Information Science;2021

5. On Polynomial Solvability of One Quadratic Euclidean Clustering Problem on a Line;Lecture Notes in Computer Science;2020