333 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- Reichman UniversityIL4 papers
- Technion – Israel Institute of TechnologyIL4 papers
- Hebrew University of JerusalemIL3 papers
- Laboratoire d’Informatique et SystèmesFR3 papers
- The University of TokyoJP3 papers
- University of HaifaIL3 papers
- Aix-Marseille UniversitéFR2 papers
- Centre National de la Recherche ScientifiqueFR2 papers
- Evangelische Hochschule BerlinDE2 papers
- Microsoft (Israel)IL2 papers
- Université de ToulonFR2 papers
- University College LondonGB2 papers
28 papers
Colorful-Noise: Training-Free Low-Frequency Noise Manipulation for Color-Based Conditional Image Generation
Nadav Z. Cohen, Ofir Abramovich, Ariel Shamir
Text-to-image diffusion models generate images by gradually converting white Gaussian noise into a natural image. White Gaussian noise is well suited for producing diverse outputs…
Improving Low-Vision Chart Accessibility via On-Cursor Visual Context
Yotam Sechayk, Hennes Rave, Max Rädler +4
Despite widespread use, charts remain largely inaccessible for Low-Vision Individuals (LVI). Reading charts requires viewing data points within a global context, which is difficult…
From Decision Trees to Boolean Logic: A Fast and Unified SHAP Algorithm
Alexander Nadel, Ron Wettenstein
SHapley Additive exPlanations (SHAP) is a key tool for interpreting decision tree ensembles by assigning contribution values to features. It is widely used in finance, advertising,…
VeasyGuide: Personalized Visual Guidance for Low-vision Learners on Instructor Actions in Presentation Videos
Yotam Sechayk, Ariel Shamir, Amy Pavel +1
Instructors often rely on visual actions such as pointing, marking, and sketching to convey information in educational presentation videos. These subtle visual cues often lack verb…
Meta-Mathematics of Computational Complexity Theory
Igor C. Oliveira
We survey results on the formalization and independence of mathematical statements related to major open problems in computational complexity theory. Our primary focus is on recent…
FontCraft: Multimodal Font Design Using Interactive Bayesian Optimization
Yuki Tatsukawa, I-Chao Shen, Mustafa Doga Dogan +4
Creating new fonts requires a lot of human effort and professional typographic knowledge. Despite the rapid advancements of automatic font generation models, existing methods requi…
Composing Quantum Algorithms
Stacey Jeffery
Composition is something we take for granted in classical algorithms design, and in particular, we take it as a basic axiom that composing ``efficient'' algorithms should result in…
Higher criticism for rare and weak non-proportional hazard deviations in survival analysis
Alon Kipnis, Ben Galili, Zohar Yakhini
We propose a method for comparing survival data based on the higher criticism of p-values obtained from multiple exact hypergeometric tests. The method accommodates non-informative…
An Information-Theoretic Approach for Detecting Edits in AI-Generated Text
Idan Kashtan, Alon Kipnis
We propose a method to determine whether a given article was written entirely by a generative language model or perhaps contains edits by a different author, possibly a human. Our…
Synchronized CTL over One-Counter Automata
Shaull Almagor, Daniel Assa, Udi Boker
We consider the model-checking problem of Synchronized Computation-Tree Logic (CTL+Sync) over One-Counter Automata (OCAs). CTL+Sync augments CTL with temporal operators that requir…
Can We Mathematically Spot Possible Manipulation of Results in Research Manuscripts Using Benford's Law?
Teddy Lazebnik, Dan Gorlitsky
The reproducibility of academic research has long been a persistent issue, contradicting one of the fundamental principles of science. What is even more concerning is the increasin…
Discounted-Sum Automata with Multiple Discount Factors
Udi Boker, Guy Hefetz
Discounting the influence of future events is a key paradigm in economics and it is widely used in computer-science models, such as games, Markov decision processes (MDPs), reinfor…
Safety and Liveness of Quantitative Properties and Automata
Udi Boker, Thomas A. Henzinger, Nicolas Mazzocchi +1
Safety and liveness stand as fundamental concepts in formal languages, playing a key role in verification. The safety-liveness classification of boolean properties characterizes wh…
Must the Communication Graph of MPC Protocols be an Expander?
Elette Boyle, Ran Cohen, Deepesh Data +1
Secure multiparty computation (MPC) on incomplete communication networks has been studied within two primary models: (1) Where a partial network is fixed a priori, and thus corrupt…
On the Comparison of Discounted-Sum Automata with Multiple Discount Factors
Udi Boker, Guy Hefetz
We look into the problems of comparing nondeterministic discounted-sum automata on finite and infinite words. That is, the problems of checking for automata and whether or…
Downward Self-Reducibility in TFNP
Prahladh Harsha, Daniel Mitropolsky, Alon Rosen
A problem is \emph{downward self-reducible} if it can be solved efficiently given an oracle that returns solutions for strictly smaller instances. In the decisional landscape, down…
Blended Latent Diffusion
Omri Avrahami, Ohad Fried, Dani Lischinski
The tremendous progress in neural image generation, coupled with the emergence of seemingly omnipotent vision-language models has finally enabled text-based interfaces for creating…
Grad-SAM: Explaining Transformers via Gradient Self-Attention Maps
Oren Barkan, Edan Hauon, Avi Caciularu +4
Transformer-based language models significantly advanced the state-of-the-art in many linguistic tasks. As this revolution continues, the ability to explain model predictions has b…
Lightweight Jet Reconstruction and Identification as an Object Detection Task
Adrian Alan Pol, Thea Aarrestad, Ekaterina Govorkova +8
We apply object detection techniques based on deep convolutional blocks to end-to-end jet identification and reconstruction tasks encountered at the CERN Large Hadron Collider (LHC…
On the Translation of Automata to Linear Temporal Logic
Udi Boker, Karoliina Lehtinen, Salomon Sickert
While the complexity of translating future linear temporal logic (LTL) into automata on infinite words is well-understood, the size increase involved in turning automata back to LT…
History Determinism vs. Good for Gameness in Quantitative Automata
Udi Boker, Karoliina Lehtinen
Automata models between determinism and nondeterminism/alternations can retain some of the algorithmic properties of deterministic automata while enjoying some of the expressivenes…
Token Games and History-Deterministic Quantitative-Automata
Udi Boker, Karoliina Lehtinen
A nondeterministic automaton is history-deterministic if its nondeterminism can be resolved by only considering the prefix of the word read so far. Due to their good compositional…
Ordered Attention for Coherent Visual Storytelling
Tom Braude, Idan Schwartz, Alexander Schwing +1
We address the problem of visual storytelling, i.e., generating a story for a given sequence of images. While each sentence of the story should describe a corresponding image, a co…
GAN Cocktail: mixing GANs without dataset access
Omri Avrahami, Dani Lischinski, Ohad Fried
Today's generative models are capable of synthesizing high-fidelity images, but each model specializes on a specific target domain. This raises the need for model merging: combinin…