default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAzimkhon Ostonov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j3]Azimkhon Ostonov
, Mikhail Moshkov:
Complexity of Deterministic and Strongly Nondeterministic Decision Trees for Decision Tables From Closed Classes. IEEE Access 12: 164979-164988 (2024)- [j2]Azimkhon Ostonov, Mikhail Moshkov:
Comparative Analysis of Deterministic and Nondeterministic Decision Trees for Decision Tables from Closed Classes. Entropy 26(6): 519 (2024) - [c6]Azimkhon Ostonov, Mikhail Moshkov:
Depth of Deterministic and Nondeterministic Decision Trees for Decision Tables with Many-Valued Decisions from Closed Classes. ACIIDS (Companion 1) 2024: 164-174 - [c5]Azimkhon Ostonov, Mikhail Moshkov:
Lower Bounds on Cardinality of Reducts for Decision Tables from Closed Classes. FedCSIS 2024: 667-670 - [c4]Azimkhon Ostonov, Mikhail Moshkov:
Greedy Algorithm for Construction of Deterministic Decision Trees for Conventional Decision Tables from Closed Classes. IJCRS (1) 2024: 93-104 - [c3]Azimkhon Ostonov, Mikhail Moshkov:
On Complexity of Deterministic and Nondeterministic Decision Trees for Decision Tables with Many-Valued Decisions from Closed Classes. IJCRS (1) 2024: 173-187 - [i6]Azimkhon Ostonov, Mikhail Moshkov:
Lower Bounds on Cardinality of Reducts for Decision Tables from Closed Classes. CoRR abs/2401.01324 (2024) - 2023
- [j1]Azimkhon Ostonov, Mikhail Moshkov:
On Complexity of Deterministic and Nondeterministic Decision Trees for Conventional Decision Tables from Closed Classes. Entropy 25(10): 1411 (2023) - [c2]Azimkhon Ostonov, Mikhail Moshkov:
Deterministic and Nondeterministic Decision Trees for Decision Tables with Many-Valued Decisions from Closed Classes. IJCRS 2023: 89-104 - [i5]Azimkhon Ostonov, Mikhail Moshkov:
Comparative Analysis of Deterministic and Nondeterministic Decision Trees for Decision Tables from Closed Classes. CoRR abs/2304.10594 (2023) - [i4]Azimkhon Ostonov, Mikhail Moshkov:
Deterministic and Strongly Nondeterministic Decision Trees for Decision Tables from Closed Classes. CoRR abs/2305.06093 (2023) - [i3]Azimkhon Ostonov, Mikhail Moshkov:
Comparison of Deterministic and Nondeterministic Decision Trees for Decision Tables with Many-valued Decisions from Closed Classes. CoRR abs/2312.01116 (2023) - 2022
- [c1]Azimkhon Ostonov, Peter Wonka, Dominik L. Michels:
RLSS: A Deep Reinforcement Learning Algorithm for Sequential Scene Generation. WACV 2022: 2723-2732 - [i2]Azimkhon Ostonov, Peter Wonka, Dominik L. Michels:
RLSS: A Deep Reinforcement Learning Algorithm for Sequential Scene Generation. CoRR abs/2206.02544 (2022) - [i1]Azimkhon Ostonov:
Cut-and-Approximate: 3D Shape Reconstruction from Planar Cross-sections with Deep Reinforcement Learning. CoRR abs/2210.12509 (2022)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-23 19:33 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
