Follow
Alexander Kel'manov
Alexander Kel'manov
Sobolev Institute of Mathematics
Verified email at math.nsc.ru
Title
Cited by
Cited by
Year
A posteriori joint detection and discrimination of pulses in a quasiperiodic pulse train
AV Kel'manov, B Jeon
IEEE Transactions on Signal Processing 52 (3), 645-656, 2004
822004
Subsequences in a Quasi-periodic Sequence
AV Kel'Manov, SA Khamidullin
COMPUTATIONAL, MATHEMATICS AND MATHEMATICAL PHYSICS 4 (5), 2001
552001
An FPTAS for a vector subset search problem
AV Kel’Manov, SM Romanchenko
Journal of Applied and Industrial Mathematics 8, 329-336, 2014
462014
NP-completeness of some problems of choosing a vector subset
AV Kel’Manov, AV Pyatkin
Journal of Applied and Industrial Mathematics 5, 352-357, 2011
462011
A posteriori detecting a quasiperiodic fragment in a numerical sequence
EK Gimadi, AV Kel’Manov, MA Kel’Manova, SA Khamidullin
Pattern Recognition and Image Analysis 18, 30-42, 2008
462008
An approximation algorithm for solving a problem of search for a vector subset
AV Kel’Manov, SM Romanchenko
Journal of Applied and Industrial Mathematics 6, 90-96, 2012
442012
Complexity of certain problems of searching for subsets of vectors and cluster analysis
AV Kel'manov, AV Pyatkin
Computational Mathematics and Mathematical Physics 49 (11), 1966, 2009
432009
A randomized algorithm for two-cluster partition of a set of vectors
AV Kel’manov, VI Khandeev
Computational Mathematics and Mathematical Physics 55, 330-339, 2015
422015
On the complexity of a search for a subset of “similar” vectors
AV Kel’Manov, AV Pyatkin
Doklady Mathematics 78, 574-575, 2008
382008
An approximation algorithm for solving a problem of cluster analysis
AV Dolgushev, AV Kel’Manov
Journal of Applied and Industrial Mathematics 5, 551-558, 2011
342011
A posteriori detection of a quasiperiodic fragment with a given number of repetitions in a numerical sequence
EK Gimadi, AV Kel'manov, MA Kelmanova, SA Khamidullin
Sibirskii Zhurnal Industrial'noi Matematiki 9 (1), 55-74, 2006
332006
On complexity of some problems of cluster analysis of vector sequences
AV Kel’Manov, AV Pyatkin
Journal of Applied and Industrial Mathematics 7, 363-369, 2013
322013
On a version of the problem of choosing a vector subset
AV Kel’Manov, AV Pyatkin
Journal of Applied and Industrial Mathematics 3, 447-455, 2009
322009
Fully polynomial-time approximation scheme for a special case of a quadratic Euclidean 2-clustering problem
AV Kel’manov, VI Khandeev
Computational Mathematics and Mathematical Physics 56, 334-341, 2016
282016
Pseudopolynomial algorithms for certain computationally hard vector subset and cluster analysis problems
AV Kel’manov, SM Romanchenko
Automation and Remote Control 73, 349-354, 2012
282012
NP-hardness of some quadratic Euclidean 2-clustering problems
AV Kel’Manov, AV Pyatkin
Doklady Mathematics 92, 634-637, 2015
272015
On the complexity of some quadratic Euclidean 2-clustering problems
AV Kel’manov, AV Pyatkin
Computational Mathematics and Mathematical Physics 56, 491-497, 2016
262016
A fully polynomial-time approximation scheme for a special case of a balanced 2-clustering problem
A Kel’manov, A Motkova
Discrete Optimization and Operations Research: 9th International Conference …, 2016
242016
Approximation polynomial algorithm for the data editing and data cleaning problem
AA Ageev, AV Kel’Manov, AV Pyatkin, SA Khamidullin, VV Shenmaier
Pattern Recognition and Image Analysis 27, 365-370, 2017
222017
An exact pseudopolynomial algorithm for a problem of the two-cluster partitioning of a set of vectors
AV Kel’Manov, VI Khandeev
Journal of Applied and Industrial Mathematics 9, 497-502, 2015
222015
The system can't perform the operation now. Try again later.
Articles 1–20