default search action
Shahid Hussain 0004
Person information
- affiliation: King Abdullah University of Science and Technology, Computer, Electrical and Mathematical Sciences and Engineering Division, Thuwal, Saudi Arabia
Other persons with the same name
- Shahid Hussain — disambiguation page
- Shahid Hussain 0001
— Kohat University of Science and Technology, Department of Computer Science, Kohat, Pakistan (and 3 more)
- Shahid Hussain 0002
- Shahid Hussain 0003
- Shahid Hussain 0005
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [i3]Mohammad Azad, Igor Chikalov, Shahid Hussain, Mikhail Moshkov, Beata Zielosko:
Greedy Algorithms for Decision Trees with Hypotheses. CoRR abs/2203.08848 (2022) - [i2]Mohammad Azad, Igor Chikalov, Shahid Hussain, Mikhail Moshkov, Beata Zielosko:
Decision Trees with Hypotheses for Recognition of Monotone Boolean Functions and for Sorting. CoRR abs/2203.08894 (2022) - 2021
- [j9]Mohammad Azad
Entropy-Based Greedy Algorithm for Decision Trees Using Hypotheses. Entropy 23(7): 808 (2021) - [j8]Mohammad Azad
Decision Rules Derived from Optimal Decision Trees with Hypotheses. Entropy 23(12): 1641 (2021) - [c16]Mohammad Azad, Igor Chikalov, Shahid Hussain, Mikhail Moshkov:
Sorting by Decision Trees with Hypotheses (extended abstract). CS&P 2021: 126-130 - [c15]Mohammad Azad, Igor Chikalov, Shahid Hussain, Mikhail Moshkov
Minimizing Number of Nodes in Decision Trees with Hypotheses. KES 2021: 232-240 - [c14]Mohammad Azad
Minimizing Depth of Decision Trees with Hypotheses. IJCRS 2021: 123-133
2010 – 2019
- 2019
- [b1]Hassan AbouEisha
Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining. Intelligent Systems Reference Library 146, Springer 2019, ISBN 978-3-319-91838-9, pp. 1-268 - 2018
- [j7]Hassan AbouEisha
Upper Domination: Towards a Dichotomy Through Boundary Properties. Algorithmica 80(10): 2799-2817 (2018) - [j6]Igor Chikalov, Shahid Hussain
Bi-criteria optimization of decision trees with applications to data analysis. Eur. J. Oper. Res. 266(2): 689-701 (2018) - 2016
- [j5]Igor Chikalov, Shahid Hussain
Totally optimal decision trees for Boolean functions. Discret. Appl. Math. 215: 1-13 (2016) - [c13]Hassan AbouEisha
A Boundary Property for Upper Domination. IWOCA 2016: 229-240 - [i1]Hassan AbouEisha
Upper Domination: towards a dichotomy through boundary properties. CoRR abs/1609.01510 (2016) - 2015
- [j4]Monther Busbait
Diagnosis of constant faults in read-once contact networks over finite bases. Discret. Appl. Math. 184: 76-88 (2015) - [c12]Mohammad Azad
Multi-pruning of decision trees for knowledge representation and classification. ACPR 2015: 604-608 - 2014
- [j3]Saad Alrawaf, Igor Chikalov, Shahid Hussain
Diagnosis of constant faults in iteration-free circuits over monotone basis. Discret. Appl. Math. 166: 287-291 (2014) - [j2]Igor Chikalov, Shahid Hussain
Relationships between Average Depth and Number of Misclassifications for Decision Trees. Fundam. Informaticae 129(1-2): 15-26 (2014) - [c11]Hassan AbouEisha
A Dichotomy for Upper Domination in Monogenic Classes. COCOA 2014: 258-267 - [c10]Shahid Hussain
Greedy heuristics for minimization of number of terminal nodes in decision trees. GrC 2014: 112-115 - [c9]Shahid Hussain
Total Path Length and Number of Terminal Nodes for Decision Trees. KES 2014: 514-521 - [p2]Shahid Hussain
Relationships Among Various Parameters for Decision Tree Optimization. Innovations in Intelligent Machines (4) 2014: 393-410 - 2013
- [j1]Abdulaziz Alkhalid, Talha Amin, Igor Chikalov, Shahid Hussain
Optimization and analysis of decision trees and rules: dynamic programming approach. Int. J. Gen. Syst. 42(6): 614-634 (2013) - [c8]Igor Chikalov, Shahid Hussain
Totally Optimal Decision Trees for Monotone Boolean Functions with at Most Five Variables. KES 2013: 359-365 - [p1]Igor Chikalov, Shahid Hussain
Relationships for Cost and Uncertainty of Decision Trees. Rough Sets and Intelligent Systems (2) 2013: 203-222 - 2012
- [c7]Igor Chikalov, Shahid Hussain, Mikhail Moshkov:
Average Depth and Number of Misclassifications for Decision Trees. CS&P 2012: 160-169 - [c6]Igor Chikalov, Shahid Hussain, Mikhail Moshkov:
On Cost and Uncertainty of Decision Trees. RSCTC 2012: 190-197 - [c5]Igor Chikalov, Shahid Hussain, Mikhail Moshkov:
Relationships between Number of Nodes and Number of Misclassifications for Decision Trees. RSCTC 2012: 212-218 - 2011
- [c4]Maram Alnafie, Igor Chikalov, Shahid Hussain, Mikhail Ju. Moshkov:
Sequential Optimization of Binary Search Trees for Multiple Cost Functions. CATS 2011: 41-44 - [c3]Igor Chikalov, Shahid Hussain
Relationships between Depth and Number of Misclassifications for Decision Trees. RSFDGrC 2011: 286-292 - [c2]Igor Chikalov, Shahid Hussain
Sequential Optimization of Matrix Chain Multiplication Relative to Different Cost Functions. SOFSEM 2011: 157-165 - [c1]Jewahir AbuBekr, Igor Chikalov, Shahid Hussain
Sequential Optimization of Paths in Directed Graphs Relative to Different Cost Functions. ICCS 2011: 1272-1277
Coauthor Index
aka: Mikhail Moshkov
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-11-22 19:43 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: