The following pages link to Sergey Khamidullin (Q2026154):
Displayed 41 items.
- (Q498593) (redirect page) (← links)
- An approximation polynomial-time algorithm for a sequence bi-clustering problem (Q498594) (← links)
- Problem of minimizing a sum of differences of weighted convolutions (Q828127) (← links)
- Posterior detection of a given number of identical subsequences in a quasi-periodic sequence (Q1395276) (← links)
- Approximation algorithm for the problem of partitioning a sequence into clusters (Q1683189) (← links)
- An approximation algorithm for a problem of partitioning a sequence into clusters with constraints on their cardinalities (Q1744981) (← links)
- An exact algorithm of searching for the largest size cluster in an integer sequence 2-clustering problem (Q2026155) (← links)
- Recognition of a quasi-periodic sequence containing an unknown number of nonlinearly extended reference subsequences (Q2048804) (← links)
- Exact algorithms for two integer-valued problems of searching for the largest subset and longest subsequence (Q2294598) (← links)
- Exact pseudopolynomial algorithm for one sequence partitioning problem (Q2362334) (← links)
- A randomized algorithm for a sequence 2-clustering problem (Q2420934) (← links)
- Точные псевдополиномиальные алгоритмы для некоторых труднорешаемых задач поиска подпоследовательности векторов (Q2838802) (← links)
- (Q2998954) (← links)
- (Q2998977) (← links)
- (Q2998997) (← links)
- (Q3005493) (← links)
- (Q3115185) (← links)
- An Approximation Algorithm for a Problem of Partitioning a Sequence into Clusters with Restrictions on Their Cardinalities (Q3133210) (← 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)
- A fully polynomial-time approximation scheme for a sequence 2-cluster partitioning problem (Q3186861) (← links)
- (Q4428016) (← links)
- (Q4429331) (← links)
- (Q4434976) (← links)
- (Q4517345) (← links)
- An Approximation Scheme for the Problem of Finding a Subsequence (Q4636841) (← links)
- (Q4787988) (← links)
- (Q4787989) (← links)
- (Q4788000) (← links)
- (Q4817499) (← links)
- (Q4936525) (← links)
- (Q4951202) (← links)
- (Q4951235) (← links)
- (Q4951373) (← links)
- One Problem of the Sum of Weighted Convolution Differences Minimization, Induced by the Quasiperiodic Sequence Recognition Problem (Q4965099) (← links)
- (Q5048139) (← links)
- 2-Approximation Polynomial-Time Algorithm for a Cardinality-Weighted 2-Partitioning Problem of a Sequence (Q5122316) (← links)
- Approximation algorithms for some intractable problems of choosing a vector subsequence (Q5263772) (← links)
- An approximating polynomial algorithm for a sequence partitioning problem (Q5264726) (← links)
- A posteriori joint detection of a recurring tuple of reference fragments in a quasi-periodic sequence (Q6191497) (← links)