A dichotomy theorem for general minimum cost homomorphism problem R Takhanov
27th International Symposium on Theoretical Aspects of Computer Science, 2007
58 2007 Extensions of the minimum cost homomorphism problem R Takhanov
International Computing and Combinatorics Conference, 328-337, 2010
16 2010 Syllable-aware neural language models: A failure to beat character-aware ones Z Assylbekov, R Takhanov, B Myrzakhmetov, JN Washington
2017 Conference on Empirical Methods in Natural Language Processing, 2017
15 2017 Fourier neural networks: A comparative study M Uteuliyeva, A Zhumekenov, R Takhanov, Z Assylbekov, AJ Castro, ...
Intelligent Data Analysis 24 (5), 1107-1120, 2020
13 * 2020 Effectiveness of structural restrictions for hybrid CSPs V Kolmogorov, M Rolínek, R Takhanov
International Symposium on Algorithms and Computation, 566-577, 2015
12 2015 Inference algorithms for pattern-based CRFs on sequence data R Takhanov, V Kolmogorov
International Conference on Machine Learning, 145-153, 2013
12 2013 Context vectors are reflections of word vectors in half the dimensions Z Assylbekov, R Takhanov
Journal of Artificial Intelligence Research 66, 225-242, 2019
7 2019 Hybrid VCSPs with Crisp and Valued Conservative Templates R Takhanov
28th International Symposium on Algorithms and Computation (ISAAC 2017), 2017
5 * 2017 Reusing weights in subword-aware neural language models Z Assylbekov, R Takhanov
2018 Conference of the North American Chapter of the Association for …, 2018
4 2018 Предикатное задание универсальных ограничений в алгебраическом подходе к задачам распознавания РС Таханов
Журнал вычислительной математики и математической физики 47 (3), 547-552, 2007
3 * 2007 Reproducing and regularizing the scrn model O Kabdolov, Z Assylbekov, R Takhanov
Proceedings of the 27th International Conference on Computational …, 2018
2 2018 Patterns versus characters in subword-aware neural language modeling R Takhanov, Z Assylbekov
International Conference on Neural Information Processing, 157-166, 2017
1 2017 Combining pattern-based CRFs and weighted context-free grammars R Takhanov, V Kolmogorov
arXiv preprint arXiv:1404.5475, 2014
1 2014 Максимальные предикатные задания множеств отображений РС Таханов
Журнал вычислительной математики и математической физики 47 (9), 1636-1648, 2007
1 2007 On the speed of uniform convergence in Mercer's theorem R Takhanov
arXiv preprint arXiv:2205.00487, 2022
2022 Spectral bounds of the R Takhanov
arXiv preprint arXiv:2204.04512, 2022
2022 Combining pattern-based CRFs and weighted context-free grammars R Takhanov, V Kolmogorov
Intelligent Data Analysis 26 (1), 257-272, 2022
2022 How many moments does MMD compare? R Takhanov
arXiv preprint arXiv:2106.14277, 2021
2021 Approximation error of Fourier neural networks A Zhumekenov, R Takhanov, AJ Castro, Z Assylbekov
Statistical Analysis and Data Mining: The ASA Data Science Journal 14 (3 …, 2021
2021 The algebraic structure of the densification and the sparsification tasks for CSPs R Takhanov
arXiv preprint arXiv:2104.05065, 2021
2021 
Zhenisbek AssylbekovNazarbayev UniversityBestätigte E-Mail-Adresse bei nu.edu.kz
