Events

Upcoming Events

Date:
22
February
2024
Hour: 12:15 - 13:15
Ziskind Building, Room 1

Extracting Multiple Concepts from a Single Image and Generating Consistent Characters

Vision and AI
Omri Avrahami
HUJI

Text-to-image model personalization aims to introduce a user-provided concept to the model, allowing its synthesis in diverse contexts. However, current methods primarily focus on the case of learning

Date:
22
February
2024
Hour: 13:30 - 14:30
Ziskind Building, Room 155

Some limit theorems for U-max statistics with geometric structure

Geometric Functional Analysis and Probability Seminar
Katya Simarova
St. Petersburg

U-max statistics, introduced by Lao and Mayer in 2008, serve as an extreme-value analogue of U-statistics. Natural examples of U-max statistics include the maximum of random variables and the diameter

Date:
29
February
2024
Hour: 13:30 - 14:30
Ziskind Building, Room 155

TBD

Geometric Functional Analysis and Probability Seminar
Jonathan Breuer
HUJI

TBD

Date:
4
March
2024
Hour: 11:15 - 12:15
Ziskind Building, Room 155

Towards general-purpose program obfuscation via local mixing

Foundations of Computer Science Seminar
Ran Canetti
Boston University

We explore the possibility of obtaining general-purpose program obfuscation for all circuits by way of making only simple, local, functionality-preserving random perturbations in the circuit structure

Date:
18
March
2024
Hour: 11:15 - 12:15
Ziskind Building, Room 155

Toward Better Depth Lower Bounds: A KRW-like theorem for Strong Composition

Foundations of Computer Science Seminar
Or Meir
University of Haifa

One of the major open problems in complexity theory is proving super-logarithmic lower bounds on the depth of circuits. Karchmer, Raz, and Wigderson (Computational Complexity 5(3/4), 1995) suggested ap

Past Events