1 citations · 1 across the 3 of their papers we have counts for
5 papers
Classes Testable with Queries for Small Independent of the Number of Variables
Nader H. Bshouty, George Haddad
In this paper, we study classes of Boolean functions that are testable with queries, where depends on the parameters of the class (e.g., the number of terms, the num…
Approximating the Number of Relevant Variables in a Parity Implies Proper Learning
Nader H. Bshouty, George Haddad
Consider the model where we can access a parity function through random uniform labeled examples in the presence of random classification noise. In this paper, we show that approxi…
Bounds for the Number of Tests in Non-Adaptive Randomized Algorithms for Group Testing
Nader H. Bshouty, George Haddad, Catherine A. Haddad-Zaknoon
We study the group testing problem with non-adaptive randomized algorithms. Several models have been discussed in the literature to determine how to randomly choose the tests. For…
Elementary Proofs of Some Stirling Bounds
Nader H. Bshouty, Vivian E. Bshouty-Hurani, George Haddad +3
We give elementary proofs of several Stirling's precise bounds. We first improve all the precise bounds from the literature and give new precise bounds. In particular, we show that…
Adaptive Group Testing Algorithms to Estimate the Number of Defectives
Nader H. Bshouty, Vivian E. Bshouty-Hurani, George Haddad +3
We study the problem of estimating the number of defective items in adaptive Group testing by using a minimum number of queries. We improve the existing algorithm and prove a lower…