The following pages link to Alexander Kel'Manov (Q1982890):
Displayed 50 items.
- (Q3005460) (← links)
- (Q3005493) (← links)
- (Q3115185) (← links)
- (Q3115213) (← links)
- (Q3115233) (← links)
- (Q3115249) (← links)
- (Q3115255) (← links)
- (Q3115704) (← links)
- An Approximation Algorithm for a Problem of Partitioning a Sequence into Clusters with Restrictions on Their Cardinalities (Q3133210) (← links)
- A Fully Polynomial-Time Approximation Scheme for a Special Case of a Balanced 2-Clustering Problem (Q3133212) (← links)
- (Q3161901) (← links)
- Optimal detection of a recurring tuple of reference fragments in a quasiperiodic sequence (Q3161944) (← links)
- A recognition problem for a vector alphabet generating a sequence with a quasiperiodic structure (Q3161983) (← links)
- An exact pseudopolynomial algorithm for a problem of the two-cluster partitioning of a set of vectors (Q3186839) (← links)
- A fully polynomial-time approximation scheme for a sequence 2-cluster partitioning problem (Q3186861) (← links)
- A posteriori joint detection of reference fragments in a quasi-periodic sequence (Q3545183) (← links)
- (Q3942425) (← links)
- (Q3942426) (← links)
- (Q4428016) (← links)
- (Q4429331) (← links)
- (Q4434976) (← links)
- (Q4517345) (← links)
- (Q4527365) (← links)
- An Approximation Scheme for the Problem of Finding a Subsequence (Q4636841) (← links)
- (Q4676672) (← links)
- (Q4787989) (← links)
- (Q4787993) (← links)
- (Q4788000) (← links)
- (Q4817499) (← links)
- (Q4888920) (← links)
- (Q4936525) (← links)
- (Q4947147) (← links)
- (Q4951202) (← links)
- (Q4951235) (← links)
- (Q4951236) (← links)
- (Q4951373) (← links)
- Exact algorithms of searching for the largest size cluster in two integer 2-clustering problems (Q5043014) (← links)
- (Q5048139) (← links)
- 2-Approximation Polynomial-Time Algorithm for a Cardinality-Weighted 2-Partitioning Problem of a Sequence (Q5122316) (← links)
- Exact Linear-Time Algorithm for Parameterized K-Means Problem with Optimized Number of Clusters in the 1D Case (Q5122317) (← links)
- The Problem K-Means and Given J-Centers: Polynomial Solvability in One Dimension (Q5214428) (← links)
- Approximation algorithms for some intractable problems of choosing a vector subsequence (Q5263772) (← links)
- On complexity of some problems of cluster analysis of vector sequences (Q5263810) (← links)
- A 2-approximation polynomial algorithm for a clustering problem (Q5263825) (← links)
- An approximating polynomial algorithm for a sequence partitioning problem (Q5264726) (← links)
- An FPTAS for a vector subset search problem (Q5264739) (← links)
- Complexity of the weighted max-cut in Euclidean space (Q5264746) (← links)
- Pseudopolynomial time solvability of a quadratic Euclidean problem of finding a family of disjoint subsets (Q5269179) (← links)
- (Q5310931) (← links)
- A Posteriori Joint Detection and Discrimination of Pulses in a Quasiperiodic Pulse Train (Q5354027) (← links)