13 citations · 32 across the 25 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
cs.LG2018★ 13 cited
On Learning Graphs with Edge-Detecting Queries
Hasan Abasi, Nader H. Bshouty
We consider the problem of learning a general graph using edge-detecting queries, where the number of vertices is given to the learner. The information theoretic…
cs.DS2018
On Polynomial time Constructions of Minimum Height Decision Tree
Nader H. Bshouty, Waseem Makhoul
In this paper we study a polynomial time algorithms that for an input outputs a decision tree for of minimum depth. This problem has many applications that i…