Zobrazeno 1 - 10
of 20 233
pro vyhledávání: '"Hillel AT"'
We consider the problem of approximate counting of triangles and longer fixed length cycles in directed graphs. For triangles, T\v{e}tek [ICALP'22] gave an algorithm that returns a $(1 \pm \eps)$-approximation in $\tilde{O}(n^\omega/t^{\omega-2})$ ti
Externí odkaz:
http://arxiv.org/abs/2409.19292
We provide a fast distributed algorithm for detecting $h$-cycles in the \textsf{Congested Clique} model, whose running time decreases as the number of $h$-cycles in the graph increases. In undirected graphs, constant-round algorithms are known for cy
Externí odkaz:
http://arxiv.org/abs/2408.15132
Autor:
Raviv, Avraham, Elboher, Yizhak Y., Aluf-Medina, Michelle, Weiss, Yael Leibovich, Cohen, Omer, Assa, Roy, Katz, Guy, Kugler, Hillel
Deep Neural Networks (DNNs) are ubiquitous in real-world applications, yet they remain vulnerable to errors and adversarial attacks. This work tackles the challenge of applying formal verification to ensure the safety of computer vision models, exten
Externí odkaz:
http://arxiv.org/abs/2407.01295
Autor:
Hillel-Tuch, Alon, Olmstead, Aspen
Publikováno v:
Springer Nature - Book Series: Transactions on Computational Science & Computational Intelligence 2022
Programming errors, defective hardware components (such as hard disk spindle defects), and environmental hazards can lead to invalid memory operations. In addition, less predictable forms of environmental stress, such as radiation, thermal influence,
Externí odkaz:
http://arxiv.org/abs/2403.08656
Autor:
Censor-Hillel, Keren, Khoury, Majd
The distance of a graph from being triangle-free is a fundamental graph parameter, counting the number of edges that need to be removed from a graph in order for it to become triangle-free. Its corresponding computational problem is the classic minim
Externí odkaz:
http://arxiv.org/abs/2402.13985
Autor:
Salvadé, Nicolas, Hillel, Tim
This paper introduces the RUMBoost model, a novel discrete choice modelling approach that combines the interpretability and behavioural robustness of Random Utility Models (RUMs) with the generalisation and predictive ability of deep learning methods
Externí odkaz:
http://arxiv.org/abs/2401.11954
Fault tolerance is a major concern in distributed computational settings. In the classic master-worker setting, a server (the master) needs to perform some heavy computation which it may distribute to $m$ other machines (workers) in order to speed up
Externí odkaz:
http://arxiv.org/abs/2312.16460
Autor:
Bar-Hillel, Lior, Dikopoltsev, Alex, Kam, Amit, Sharabi, Yonatan, Segal, Ohad, Lustig, Eran, Segev, Mordechai
We study the time-reflection and time-refraction of waves caused by a spatial interface with a medium undergoing a sudden temporal change in permittivity. We show that monochromatic waves are transformed into a pulse by the permittivity change, and t
Externí odkaz:
http://arxiv.org/abs/2311.15070
Autor:
Cohen, Hillel, author
Publikováno v:
Jerusalem Transformed : Politics, Culture, and Hidden Corners, 2024.
Externí odkaz:
https://doi.org/10.1093/oso/9780197783214.003.0009
Publikováno v:
Proceedings of the 61st Annual Meeting of the Association for Computational Linguistics (Volume 3: System Demonstrations), Pages 282-290, Toronto, Canada, July 2023
Information extraction systems often produce hundreds to thousands of strings on a specific topic. We present a method that facilitates better consumption of these strings, in an exploratory setting in which a user wants to both get a broad overview
Externí odkaz:
http://arxiv.org/abs/2309.10057