Zobrazeno 1 - 10
of 51
pro vyhledávání: '"Kamil Khadiev"'
Publikováno v:
Mathematics, Vol 11, Iss 22, p 4707 (2023)
We suggest a new technique for developing noisy tree data structures. We call it a “walking tree”. As applications of the technique we present a noisy Self-Balanced Binary Search Tree (we use a Red–Black tree as an implementation) and a noisy s
Externí odkaz:
https://doaj.org/article/5894a68f1e6d41cf8167aa6f21777b58
Autor:
Farid Ablayev, Marat Ablayev, Joshua Zhexue Huang, Kamil Khadiev, Nailya Salikhova, Dingming Wu
Publikováno v:
Big Data Mining and Analytics, Vol 3, Iss 1, Pp 56-67 (2020)
This is a review of quantum methods for machine learning problems that consists of two parts. The first part, "quantum tools", presented some of the fundamentals and introduced several quantum tools based on known quantum search algorithms. This seco
Externí odkaz:
https://doaj.org/article/f054b0272ae94394baf7cc0ea4245339
Autor:
Farid Ablayev, Marat Ablayev, Joshua Zhexue Huang, Kamil Khadiev, Nailya Salikhova, Dingming Wu
Publikováno v:
Big Data Mining and Analytics, Vol 3, Iss 1, Pp 41-55 (2020)
This is a review of quantum methods for machine learning problems that consists of two parts. The first part, "quantum tools", presents the fundamentals of qubits, quantum registers, and quantum states, introduces important quantum tools based on kno
Externí odkaz:
https://doaj.org/article/b16ae8cc79954bb48ec530cf9423e6c5
Autor:
Kamil Khadiev, Aliya Khadieva
Publikováno v:
Mathematics, Vol 10, Iss 1, p 143 (2022)
We consider online algorithms with respect to the competitive ratio. In this paper, we explore one-way automata as a model for online algorithms. We focus on quantum and classical online algorithms. For a specially constructed online minimization pro
Externí odkaz:
https://doaj.org/article/812db9c553054a0192b9e67b2222ca3e
Publikováno v:
Mathematics, Vol 10, Iss 3, p 377 (2022)
We study algorithms for solving three problems on strings. These are sorting of n strings of length k, “the Most Frequent String Search Problem”, and “searching intersection of two sequences of strings”. We construct quantum algorithms that a
Externí odkaz:
https://doaj.org/article/6873653bc38649a480a64537447a5cf2
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 252, Iss Proc. AFL 2017, Pp 205-218 (2017)
We introduce an affine generalization of counter automata, and analyze their ability as well as affine finite automata. Our contributions are as follows. We show that there is a language that can be recognized by exact realtime affine counter automat
Externí odkaz:
https://doaj.org/article/b4293d94289f491f8d8450827c98ff6d
Autor:
Andris Ambainis, Kaspars Balodis, Jānis Iraids, Kamil Khadiev, Vladislavs Kļevickis, Krišjānis Prūsis, Yixin Shen, Juris Smotrovs, Jevgēnijs Vihrovs
Publikováno v:
Quantum Information Processing. 22
Autor:
Kamil Khadiev, Aliya Khadieva, Mansur Ziatdinov, Ilnaz Mannapov, Dmitry Kravchenko, Alexander Rivosh, Ramis Yamilov
Publikováno v:
Theoretical Computer Science. 920:76-94
Autor:
Kamil Khadiev, Vladislav Remidovskii
Publikováno v:
Nonlinear Phenomena in Complex Systems. 24:207-221
We study algorithms for solving the problem of assembling a text (long string) from a dictionary (a sequence of small strings). The problem has an application in bioinformatics and has a connection with the sequence assembly method for reconstructing
Publikováno v:
International Journal of Foundations of Computer Science. 32:827-847
We introduce the affine OBDD model and show that zero-error affine OBDDs can be exponentially narrower than bounded-error unitary and probabilistic OBDDs on certain problems. Moreover, we show that Las-Vegas unitary and probabilistic OBDDs can be qua