activity
20142018
most citedOn Learning Graphs with Edge-Detecting Queries

13 citations · 20 across the 6 of their papers we have counts for

collaborators

6 papers

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.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…

cs.LG2014★ 1 cited

Learning Boolean Halfspaces with Small Weights from Membership Queries

Hasan Abasi, Ali Z. Abdi, Nader H. Bshouty

We consider the problem of proper learning a Boolean Halfspace with integer weights from membership queries only. The best known algorithm for this problem is an…

cs.LG2014★ 5 cited

On Exact Learning Monotone DNF from Membership Queries

Hasan Abasi, Nader H. Bshouty, Hanna Mazzawi

In this paper, we study the problem of learning a monotone DNF with at most terms of size (number of variables in each term) at most ( term -MDNF) from membership que…

cs.DS2014

A Simple Algorithm for Hamiltonicity

Hasan Abasi, Nader H. Bshouty

We develop a new algebraic technique that solves the following problem: Given a black box that contains an arithmetic circuit over a field of characteristic of degree~.…

cs.DS2014

On -Simple -Path

Hasan Abasi, Nader H. Bshouty, Ariel Gabizon +1

An -simple -path is a {path} in the graph of length that passes through each vertex at most times. The -SIMPLE -PATH problem, given a graph as input, asks w…