Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Mannapov, Ilnaz"'
Autor:
Mannapov, Ilnaz
This work is related to the implementation of a decision tree construction algorithm on a quantum simulator. Here we consider an algorithm based on a binary criterion. Also, we study the improvement capability with quantum heuristic QAOA. We implemen
Externí odkaz:
http://arxiv.org/abs/2212.14725
Publikováno v:
CEUR Workshop Proceedings, Volume 2500, paper 6, 2019
In the paper, we focus on complexity of C5.0 algorithm for constructing decision tree classifier that is the models for the classification problem from machine learning. In classical case the decision tree is constructed in $O(hd(NM+N \log N))$ runni
Externí odkaz:
http://arxiv.org/abs/1907.06840
Autor:
Khadiev, Kamil, Khadieva, Aliya, Ziatdinov, Mansur, Kravchenko, Dmitry, Rivosh, Alexander, Yamilov, Ramis, Mannapov, Ilnaz
We consider online algorithms with respect to the competitive ratio. Here, we investigate quantum and classical one-way automata with non-constant size of memory (streaming algorithms) as a model for online algorithms. We construct problems that can
Externí odkaz:
http://arxiv.org/abs/1802.05134
Autor:
Khadiev, Kamil, Khadieva, Aliya, Ziatdinov, Mansur, Mannapov, Ilnaz, Kravchenko, Dmitry, Rivosh, Alexander, Yamilov, Ramis
Publikováno v:
In Theoretical Computer Science 12 June 2022 920:76-94
Autor:
Khadiev, Kamil, Khadieva, Aliya, Kravchenko, Dmitry, Rivosh, Alexander, Yamilov, Ramis, Mannapov, Ilnaz
We consider online algorithms with respect to the competitive ratio. Here, we investigate quantum and classical one-way automata with non-constant size of memory (streaming algorithms) as a model for online algorithms. We construct problems that can
Externí odkaz:
http://arxiv.org/abs/1710.09595
Online algorithm is a well-known computational model. We introduce quantum online algorithms and investigate them with respect to a competitive ratio in two points of view: space complexity and advice complexity. We start with exploring a model with
Externí odkaz:
http://arxiv.org/abs/1709.08409