Zobrazeno 1 - 10
of 89
pro vyhledávání: '"Grinshpoun, Tal"'
Students' decisions on whether to take a class are strongly affected by whether their friends plan to take the class with them. A student may prefer to be assigned to a course they likes less, just to be with their friends, rather than taking a more
Externí odkaz:
http://arxiv.org/abs/2309.09684
We present an efficient algorithm that, given a discrete random variable $X$ and a number $m$, computes a random variable whose support is of size at most $m$ and whose Kolmogorov distance from $X$ is minimal, also for the one-sided Kolmogorov approx
Externí odkaz:
http://arxiv.org/abs/2207.07916
Publikováno v:
International Journal of Information Security 2022
The problem of attacks on neural networks through input modification (i.e., adversarial examples) has attracted much attention recently. Being relatively easy to generate and hard to detect, these attacks pose a security breach that many suggested de
Externí odkaz:
http://arxiv.org/abs/2201.05071
Publikováno v:
In Artificial Intelligence April 2024 329
Autor:
Shufan, Elad1 (AUTHOR) elads@sce.ac.il, Grinshpoun, Tal2 (AUTHOR), Ikar, Ehud2 (AUTHOR), Ilani, Hagai3 (AUTHOR)
Publikováno v:
International Journal of Production Research. Jan 2023, Vol. 61 Issue 1, p183-197. 15p. 1 Illustration, 10 Diagrams, 1 Chart.
Autor:
Brama, Haya, Grinshpoun, Tal
The growing incorporation of artificial neural networks (NNs) into many fields, and especially into life-critical systems, is restrained by their vulnerability to adversarial examples (AEs). Some existing defense methods can increase NNs' robustness,
Externí odkaz:
http://arxiv.org/abs/2003.07573
Publikováno v:
In Thinking Skills and Creativity December 2023 50
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
The research on coalitional games has focused on how to share the reward among a coalition such that players are incentivised to collaborate together. It assumes that the (deterministic or stochastic) characteristic function is known in advance. This
Externí odkaz:
http://arxiv.org/abs/1910.11737
In recent years, several studies proposed privacy-preserving algorithms for solving Distributed Constraint Optimization Problems (DCOPs). All of those studies assumed that agents do not collude. In this study we propose the first privacy-preserving D
Externí odkaz:
http://arxiv.org/abs/1905.09013