5 citations · 10 across the 5 of their papers we have counts for
7 papers
The aperiodic Domino problem in higher dimension
Antonin Callard, Benjamin Hellouin de Menibus
The classical Domino problem asks whether there exists a tiling in which none of the forbidden patterns given as input appear. In this paper, we consider the aperiodic version of t…
Private Boosted Decision Trees via Smooth Re-Weighting
Vahid R. Asadi, Marco L. Carmosino, Mohammadmahdi Jahanara +2
Protecting the privacy of people whose data is used by machine learning algorithms is important. Differential Privacy is the appropriate mathematical framework for formal guarantee…
Sparsification of Decomposable Submodular Functions
Akbar Rafiey, Yuichi Yoshida
Submodular functions are at the core of many machine learning and data mining tasks. The underlying submodular functions for many of these tasks are decomposable, i.e., they are su…
On the Complexity of CSP-based Ideal Membership Problems
Andrei A. Bulatov, Akbar Rafiey
In this paper we consider the Ideal Membership Problem (IMP for short), in which we are given real polynomials and the question is to decide whether belo…
Fast and Private Submodular and -Submodular Functions Maximization with Matroid Constraints
Akbar Rafiey, Yuichi Yoshida
The problem of maximizing nonnegative monotone submodular functions under a certain constraint has been intensively studied in the last decade, and a wide range of efficient approx…
Counting maximal near perfect matchings in quasirandom and dense graphs
Yifan Jing, Akbar Rafiey
A maximal -near perfect matching is a maximal matching which covers at least vertices. In this paper, we study the number of maximal near perfe…