13 citations · 32 across the 25 of their papers we have counts for
Showing 2015Show all
3 papers · 1 filter
cs.DM2015
Almost Optimal Cover-Free Families
Nader H. Bshouty, Ariel Gabizon
Roughly speaking, an -Cover Free Family (CFF) is a small set of -bit strings such that: "in any indices we see all patterns of weight ". CFFs have been of…
cs.DM2015
Lower Bounds for Cover-Free Families
Ali Z. Abdi, Nader H. Bshouty
Let be a set of blocks of a -set . is called -cover-free family (CFF) provided that, the intersection of any blocks in …
cs.LG2015★ 1 cited
Non-Adaptive Learning a Hidden Hipergraph
Hasan Abasi, Nader H. Bshouty, Hanna Mazzawi
We give a new deterministic algorithm that non-adaptively learns a hidden hypergraph from edge-detecting queries. All previous non-adaptive algorithms either run in exponential tim…