דלג לתוכן (מקש קיצור 's')
אירועים

# אירועים והרצאות בפקולטה למדעי המחשב ע"ש הנרי ומרילין טאוב

מחרוזות דה‫-‬ברויין מאוזנות
שגיא מרקוביץ
יום ראשון, 23.04.2023, 16:30
הרצאת זום: 92840391109
Balanced sequences and balanced codes have attracted a lot of research in the last seventy years due to their diverse applications in information theory as well as other areas of computer science and engineering. There have been some methods to classify balanced sequences. This work suggests two new different hierarchies to classify these sequences. The first one is based on the largest $\ell$ for which each $\ell$-tuple is contained the same amount of times in the sequence. This property is a g...

יום פתוח לתארים מתקדמים במדעי המחשב
יום רביעי, 19.04.2023, 12:30
טאוב 337
היום הפתוח במדעי המחשב בטכניון מזמין בוגרי תואר ראשון מצטיינים מכל האוניברסיטאות להירשם ללימודי תארים מתקדמים בפקולטה למדעי המחשב בסמסטר חורף תשפ"ד. האירוע יתקיים ביום ד', 19 באפריל, 2023, בין השעות 12:30-14:00, חדר 337, בניין טאוב למדעי המחשב בטכניון. תוכנית הי...

Coding Theory: Interleaved (Rank-Metric) Codes for Cryptography
Prof. Antonia Wachter-Zeh (University of Munich)
יום שלישי, 04.04.2023, 15:00
טאוב 601
Public-key cryptography is the foundation for establishing secure communication between multiple parties. Traditional public-key algorithms such as RSA are based on the hardness of factoring large numbers or the discrete logarithm problem, but can be attacked in polynomial time once a capable quantum computer exists. Code-based public-key cryptosystems are considered to be post-quantum secure, but compared to RSA or elliptic curve cryptography their crucial drawback is the significantly larger k...

חקירת אלגוריתמי פינוי מתקדמים בעבור מטמון תרגום הכתובות
אלה שחורי
יום שלישי, 04.04.2023, 14:30
טאוב 301
The translation lookaside buffer (TLB’’) is a small cache that accelerates virtual to physical address translation, which processors typically manage with variants of the least recently used (LRU’’) algorithm. Although LRU is simple, it is suboptimal for some workloads. Our analysis shows that if the processor uses the optimal---but impractical---Belady algorithm instead of LRU, runtime improves by up to 15% (and 5% on average) over LRU in single-thread (ST’’) mode. Runtime fur...

Pixel Club: Machine Learning and Data Assimilation in the Natural Sciences and Engineering
Rebecca Willet (University of Chicago)
יום שלישי, 04.04.2023, 11:30
טאוב 012 (אודיטוריום, מרכז רב תכליתי)
The potential for machine learning to revolutionize scientific and engineering research is immense, but its transformative power cannot be fully harnessed through the use of off-the-shelf tools alone. To unlock this potential, novel methods are needed to integrate physical models and constraints into learning systems, accelerate simulations, and quantify model prediction uncertainty. In this presentation, we will explore the opportunities and emerging tools available to address these challenges ...

מפגש "דמוקרטיה, הי-טק ודור העתיד"
יום שני, 03.04.2023, 17:30
אודיטוריום 1 בניין טאוב למדעי המחשב
הנכם מוזמנים למפגש עם בכירי ההי-טק על "דמוקרטיה, היי-טק ודור העתיד", בהשתתפות: ד"ר קירה רדינסקי, נדיר יזרעאל, ד"ר ארנה ברי, מולי אדן, יורם יעקבי, אורי הדומי וד"ר יונתן יניב, ביום שני, 3 באפריל 2023, 17:30, בטאוב 1. נא ...

קשרים בין למידת מכונה ותאוריה של מדעי המחשב
גל יהודה
יום שני, 03.04.2023, 10:00
טאוב 601
We present connections between machine learning and theoretical computer science. In particular: hardness of data-set generation for deep learning problems and connections between randomness and computation in deep learning. ...

סדנה מעשית מטעם CYE
יום ראשון, 02.04.2023, 18:30
טאוב 337
הנכם מוזמנים לסדנת טסטים מעשית מטעם חברת CYE בהנחיית טל סיחונוב, מנהל קבוצת פיתוח בחברת CYE אשר ידבר על חשיבות הטסטים בתעשייה ובעולם הפיתוח, בדגש על מערכות SaaS, ויתרגל טכניקות של כתיבת טסטים אפקטיבית בPython, ביום ראשון, 2 באפריל, 2023 בשעה 18:30 בטאוב 337 ההשתתפות בסדנה דורשת עמיד...

האקתון מדעי המחשב CS Hackathon - Doing Good - 2023
יום חמישי, 30.03.2023, 10:30
בניין טאוב למדעי המחשב
הנכם מוזמנים להצטרף לתחרות התכנות-CS Hackathon- Doing Good בפקולטה למדעי המחשב, בשיתוף בי"ח לילדים ברמב"ם, שתתקיים בימים חמישי-שישי, 30-31 במרס, 2023, בבניין טאוב למדעי המחשב, ואשר תעסוק השנה בפיתוח פתרונות שיסייעו לשפר את איכות ח...

Coding Theory: Binary Codes with Resilience Beyond 1/4 via Interaction
קלים אפרנקו (אונ' בן-גוריון)
יום רביעי, 29.03.2023, 16:30
טאוב 601
In the reliable transmission problem, a sender, Alice, wishes to transmit a bit-string x to a remote receiver, Bob, over a binary channel with adversarial noise. The solution to this problem is to encode x using an error-correcting code. As it is long known that the distance of binary codes is at most 1/2, reliable transmission is possible only if the channel corrupts (flips) at most a 1/4-fraction of the communicated bits. We revisit the reliable transmission problem in the two-way setting, wh...

תובלה מיטבית עמוקה: אלגוריתם מעשי לשחזור תמונה פוטוריאליסטי
תיאו אדראי
יום רביעי, 29.03.2023, 11:30
In image restoration, traditional supervised methods that seek to restore the source enjoy exceptional distortion performance but lack visual quality. With the emergence of powerful generative algorithms, many approaches focus on image realism and diversity, but forsake faithfulness to the source. Motivated by recent theoretical findings, we present a practical algorithm that optimizes source fidelity while aiming for photo-realistic results. Our method optimally transports the distribution of M...

מיכאל ציבולבסקי (מדעי המחשב, טכניון)
יום שלישי, 28.03.2023, 11:30
הרצאת זום: 184212013
Proper X-ray radiation design (via dynamic fluence field modulation, FFM) allows reducing effective radiation dose in computed tomography without compromising image quality. It takes into account patient anatomy, radiation sensitivity of different organs and tissues, and location of regions of interest. We account for all these factors within a general convex optimization framework. Joint work with Anatoli Juditsky and Arkadi Nemirovski Short bio: Michael Zibulevsky received his BS-MS in Ele...

אירוע אמזון: תוכנית התמחות בקניות Alexa
יום שני, 27.03.2023, 10:00
קומה 2, בניין טאוב למדעי המחשב
מפגש היכרות עם תוכנית ההתמחות של Amazon Research, Alexa Shopping 2023 יתקיים ביום שני. 27 במרס, 10:00-11:30 בקומה 2, בניין טאוב למדעי המחשב, ויציג את אתגרי המחקר שלה ותוכנית ההתמחות במחקר לשנת 2023 לסטודנטים לתארים מתקדמים ב-CS/EE/IEM: תוכנית: 10:00-10:20 - היכרות עם תוכנית ההתמ...

Pixel Club: Mental Model in Escape Room: a First-Person POV
Jianbo Shi (University of Pennsylvania)
יום חמישי, 23.03.2023, 13:30
חדר 1063, בניין מאייר, הפקולטה להנדסת חשמל
In an Escape-room setting, we study different human behaviors when completing time-constrained tasks involving sequential decision-making and actions. We aim to construct a human mental model linking attention, episodic memory, and hand-object interaction. We record from two egocentric cameras: a head-mounted camera and Gaze-tracking glasses. We also record from up to four third-person cameras. Additionally, we created a detailed 3D map of the room. In this talk, I will discuss the progress we ...

Theory Seminar: Linear-Size Distance Oracles and Interactive Graph Structures
עידן שבת (אונ' בן-גוריון)
יום רביעי, 22.03.2023, 12:30
טאוב 201
Given an undirected weighted graph, a distance oracle is a data structure that answers distance queries in the graph within a short time. A path-reporting distance oracle (PRDO) is a distance oracle that is also required to return a shortest path between the queried vertices. A particular interest is in oracles that have a linear storage size in the number of vertices of the input graph, and also have small query time and a good approximation factor (called the stretch). Throughout the years, t...

פרדוקס ברייס ברשתות משנה של מערכות תשלומים מבוססות בלוקציין
ארד קוצר
יום רביעי, 22.03.2023, 11:30
הרצאת זום: 98170371363 וטאוב 401
Layer-2 is a popular approach to deal with the scalability limitation of blockchain networks. It allows users to execute transactions without committing them to the blockchain by relying on predefined payment channels. Users together with the payment channels form a graph known as the offchain network topology. Transactions between pairs of users without a connecting channel are also supported through a path of multiple channels. Serving such transactions involves fees paid to intermediate users...

למידה עמוקה בייס-אדאפטיבית לחיזוקים על-בסיס ניגודים
עירא חשן
יום חמישי, 16.03.2023, 11:00
טאוב 601
In meta reinforcement learning (meta RL), an agent seeks a Bayes-optimal policy – the optimal policy when facing an unknown task that is sampled from some known task distribution. Previous approaches tackled this problem by inferring a belief over task parameters, using variational inference methods. Motivated by recent successes of contrastive learning approaches in RL, such as contrastive predictive coding (CPC), we investigate whether contrastive methods can be used for learning Bayes-optim...

אלגוריתמים יעילים וחסינים לנפילות עבור מודלי תקשורת מעורבים ואופטימיזציה מבוזרת
נועה שילר
יום חמישי, 16.03.2023, 10:30
טאוב 301
We study a hybrid distributed model, which combines message-passing and shared-memory communication layers, and investigate the minimal number of failures that can partition such systems. We prove that this number precisely captures the resilience that can be achieved by algorithms that implement a variety of shared objects and solve common tasks, like approximate agreement. In the cluster-based model, processes are partitioned into disjoint clusters. We solve the approximate agreement problem...

שירותים מבוזרים תחת מתקפה
שיר כהן
יום רביעי, 15.03.2023, 11:30
טאוב 601
For my PhD thesis seminar, I will be presenting two of my works related to the security and reliability of distributed services in the face of Byzantine attacks. In the first work “Not a COINcidence: Sub-Quadratic Asynchronous Byzantine Agreement WHP” (DISC’20), I present a solution for binary Byzantine Agreement (BA) in asynchronous systems, using a shared coin algorithm based on a VRF and VRF-based committee sampling. My algorithms work against a delayed-adaptive adversary with a word co...

גישה מבוססת צביעה להרצה מקבילית של עסקאות וחוזים חכמים במערכות שכפול אקטיבי ומערכות בלוקצ'יין
ירון חי
יום רביעי, 15.03.2023, 11:30
טאוב 301
Blockchain Networks, especially those with Smart Contracts, are well-known examples of Active Replication Systems. Active Replication Services are available thanks to a group of servers called replicas that handle client requests. Each server maintains a local copy of the global state of the service, and all servers update their local copy at synchronized incremental steps. At the i-th step, all servers receive the *same* transaction from a global ordering service, execute it and apply the resul...

CGGC Seminar: Intro to Morse Theory, Morse-Smale Complexes, and Discrete Morse Theory
Rephael wenger (The ohio State University)
יום חמישי, 16.02.2023, 11:30
טאוב 401
Rephael Wenger is a professor in the computer science and engineering department of The Ohio State university where he works on geometric modeling, mesh generation, geometric algorithms and scientific visualization....

Theory seminar: Algorithms Should Have Bullshit Detectors! (or Polynomial Time Byzantine Agreement with Optimal Resilience)
Seth pettie (University of Michigan)
יום רביעי, 15.02.2023, 12:30
טאוב 201
One thing that distinguishes (theoretical) computer science from other scientific disciplines is its full-throated support of a fundamentally adversarial view of the universe. Malicious adversaries, with unbounded computational advantages, attempt to foil our algorithms at every turn and destroy their quantitative guarantees. However, there is one strange exception to this world view and it is this: the algorithm must accept its input as sacrosanct, and may never simply reject its input as illeg...

גישה חישובית לאיתור מבני חלבונים המפרים את הדוגמה המרכזית של הביולוגיה
אביב א. רוזנברג
יום ראשון, 12.02.2023, 12:30
Zoom Lecture: 97521197354 וטאוב 601
Proteins fold from a sequence of amino acids, forming secondary structures which subsequently fold into a three-dimensional structure that enables their function. The amino acid sequence is defined in the genetic sequence as codons, many of which are synonymous, i.e., they code for the same amino acid. The "one sequence, one structure" dogma, established over half a century ago, remains the commonly accepted notion, and implies that synonymous coding is inconsequential to protein structure. Thi...

פולימורפיזמים מוכללים
גלעד צ'ייס
יום ראשון, 12.02.2023, 11:30
הרצאת זום: 92374147324 וטאוב 301
We determine all $m$-ary Boolean functions $f_0,\ldots,f_m$ and $n$-ary Boolean functions $g_0,\ldots,g_n$ satisfying the equation $f_0(g_1(z_{11},\ldots,z_{1m}),\ldots,g_n(z_{n1},\ldots,z_{nm})) = g_0(f_1(z_{11},\ldots,z_{n1}),\ldots,f_m(z_{1m},\ldots,z_{nm})),$ for all Boolean inputs $\{ z_{ij} : i \in [n], j \in [m] \}$. This extends characterizations by Dokow and Holzman[DH09] (who considered the case $g_0 = \cdots = g_n$) and by Chase, Filmus, Minzer, Mossel and Saurabh [CFMMS22] (who consi...

התאוששות עצלה מריצה כושלת בעזרת זיכרון עמיד
אלמוג צור
יום רביעי, 08.02.2023, 15:30
טאוב 601
Recent non-volatile main memory technology (such as Intel’s Optane) gave rise to an abundance of research on building persistent data structures, whose content can be recovered after a system crash. While there has been significant progress in making durable data structures efficient, shortening the length of the recovery phase after a crash (in which data cannot be accessed) has not received much attention. In fact, programmers need to choose exclusively between durable data structures that p...

CS Lecture: Reexamining Basic OS Memory Management Techniques
נדב עמית (VMware Research)
יום שלישי, 07.02.2023, 10:30
טאוב 601
Despite significant advancements in operating system memory management, our understanding of the desired behavior of fundamental techniques introduced decades ago is sometimes incomplete or not well-defined. This can result in correctness issues that might cause the system to crash or be compromised, as well as missed opportunities for optimizations. In this talk, I will present two specific examples of this: (1) the inefficiencies in synchronizing the memory view across different CPU cores, and...

EuroTech: Using Concurrent Objects in Randomized Programs
Hagit Attiya (CS, Technion) and Constantin Enea (École Polytechnique/CNRS)
יום חמישי, 02.02.2023, 15:00
הרצאת זום: הרשמה
Atomic concurrent objects, whose operations take place instantaneously, are a powerful technique for designing complex concurrent programs. Since they are not always available, they are typically substituted with software implementations. A prominent condition relating these implementations to their atomic specifications is linearizability, which preserves safety properties of programs using them. However linearizability does not preserve hyper-properties, which include probabilistic guarantees ...

מערכות בלוקצ'יין עם שיהוי נמוך על ידי הולגרפייה בגרפים מכוונים ללא מעגלים
מתן יחיאלי
יום רביעי, 01.02.2023, 11:30
הרצאת זום: 93583582399 וטאוב 401
Classical Proof-of-Work blockchains like Bitcoin implement a decentralized ledger, where anyone can participate. They aggregate transactions from system users in blocks and decide each block's position in the ledger. They require the block at each position to accrue votes until the probability of a decision change, due to chance or malice, is negligible. To allow consumer usage of such systems, low latency in the order of seconds is necessary. In classical blockchain systems latency is in the or...

CS Lecture: Computational Imaging for Scientific Discovery: From Cloud Physics to Black Holes Dynamics
Aviad Levis (Computing and Mathematics at Caltech)
יום רביעי, 01.02.2023, 10:30
טאוב 601
Imaging plays a key role in advancing science, from revealing the internal structure of clouds to providing the first visual evidence of a black hole. While both examples come from different imaging systems, they illustrate what can be achieved with modern computational approaches. Computational imaging combines concepts from physics, machine learning, and signal processing to reveal hidden structures at the smallest and largest of scales. In this talk, I will highlight how peeling away layers o...

אימות ללא קריפטוגרפיה ברשת הפנימית של הרכב בהתבסס על מיקום הרכיבים
אלי גבריל
יום שני, 30.01.2023, 14:30
הרצאת זום: 8355062003
Vehicles possess an extraordinary amount of technological features that are meant to improve the safety and comfort of the driving experience. Those features have become so advanced that many of the driving aspects are now almost completely automated. Most drivers in the world now rely on the computer systems of the vehicle itself in order to perform even the most basic tasks, such as steering and parking. The CAN bus is the main network used for communication between the various systems of t...

פיתוח טכניקות חדשניות של ראיה ממוחשבת ולמידה עמוקה בתחום הפתולוגיה הדיגיטלית
אריאל לארי
יום חמישי, 26.01.2023, 11:00
הרצאת זום: 98200430832 והפקולטה לרפואה, חדר סמינרים, קומה 4
The diagnosis and treatment planning of many diseases, such as cancer and auto-immune conditions, rely on histological slides. In recent years, digital pathology has become more abundant allowing high-thruput digitization of pathology images and the use of AI to analyze and interpret them. Yet, there are still inherent challenges in harnessing AI for pathology that includes coping with features in multiple size scales, the ability to achieve interpretability of the AI results, and biased dataset...

CS Guest Lecture: Software Development in the Sixth Epoch of Distributed Computing
Tim Mattson (Senior principal engineer, Intel)
יום חמישי, 26.01.2023, 10:30
Zoom Lecture: 94604196201
Amin Vahdat, in a talk that has gone viral, described the five epochs of distributed computing (https://www.youtube.com/watch?v=Am_itCzkaE0). It’s a great talk, but I disagree with him on one key point. He thinks we are early in the fifth Epoch. I say we entered the fifth Epoch several years ago and we are on the verge of the next Epoch … the sixth Epoch of distributed computing. In this talk I will very briefly outline the five Epochs of distributed computing and then shift to the fut...

Theory Seminar: Hitting Minors, Planarization, and Kernelization
Michal Wlodarczyk (Ben-Gurion University)
יום רביעי, 25.01.2023, 12:30
טאוב 201
The concept of a graph minor is fundamental in topological graph theory. First, I will describe the cornerstones of this theory from the lens of parameterized complexity. Next, I will survey more recent results concerning minor-hitting problems, focusing on three algorithmic paradigms: approximation, kernelization, and parameterized algorithms. Here, an important special case is the Vertex Planarization problem (remove as few vertices as possible to make a given graph planar) – this problem is...

יריד פרוייקטים ב-IoT, אנדרואיד, ארדואינו ורשתות
יום שלישי, 24.01.2023, 12:30
קומת הכניסה, בניין טאוב למדעי המחשב
הנכם מוזמנים ליריד הפרוייקטים של הפקולטה למדעי המחשב ע"ש טאוב לסמסטר חורף תשפ"ג, אשר ובו יציגו וידגימו 30 צוותים של סטודנטים לתואר ראשון פרוייקטים בתחומים שונים במערכות IoT, אנדרואיד ארדואינו ורשתות, שפותחו במסגרת פרוייקט הגמר במסלול להנדסת תוכנה וברשתות תקשורת, רובם ...

CS Lecture: Building the Foundations of Explainable and Interpretable Machine Learning
מיכל מושקוביץ (Bosch Center ואונ' תל-אביב)
יום ראשון, 22.01.2023, 10:30
טאוב 601
Machine learning (ML) is integrated into our society, it is present in the judicial, health, transportation, and financial systems. As the integration increases, the necessity of ML transparency increases. The fields of explainable and interpretable ML attempt to add transparency to ML: either by adding explanations to a given black-box ML model or by building a model which is interpretable and self-explanatory. Despite the importance of explainability and interpretability, their foundations...

CS Guest Lecture: Open Software for the Parallel, Heterogeneous Future
Guy Tamir (Technology Evangelist, Intel)
יום חמישי, 19.01.2023, 10:30
Zoom Lecture: 97146417324
The race for performance and the variety of specialized workloads drives the industry to build more parallel, heterogenous, and distributed computing systems. These systems introduce multiple programming challenges. This talk will overview the driving forces, world trends, challenges, and emerging solutions. Specifically, we will overview the oneAPI Initiative and its components and benefits. We will demonstrate SYCL's new programming paradigm and more. Biography: Guy Tamir is a technology evan...

Theory Seminar: Verifying The unseen: Interactive proofs for Label-Invariant distribution Properties
טל הרמן (מכון ויצמן למדע)
יום רביעי, 18.01.2023, 12:30
טאוב 201
Given i.i.d. samples from an unknown distribution over a large domain [N], approximating several basic quantities, including the distribution’s support size, its entropy, and its distance from the uniform distribution, requires (NlogN) samples [Valiant and Valiant, STOC 2011]. Suppose, however, that we can interact with a powerful but untrusted prover, who knows the entire distribution (or a good approximation of it). Can we use such a prover to approximate (or rather, to approximately {\em...

יום זרקור של חברת מובילאיי
יום רביעי, 18.01.2023, 12:30
קומת הכניסה, בניין טאוב למדעי המחשב
נציגי מובילאיי יגיעו לפקולטה ויציגו את פיתוח התוכנה והאלגוריתמיקה של הרכב האוטונומי של מובילאיי, את אפשרויות התעסוקה ואת החיים בחברה, ביום רביעי, 18 בינואר, 2023, 12:30 בלובי טאוב....

Pixel Club: Computational Imaging for Enabling Vision Beyond Human Perception
Mark Sheinin (Carnegie Mellon)
יום שלישי, 17.01.2023, 11:30
חדר 1003, בניין מאייר, הפקולטה להנדסת חשמל
From minute surface vibrations to very fast-occurring events, the world is rich with phenomena humans cannot perceive. Likewise, most computer vision systems are primarily based on 'conventional' cameras, which were designed to mimic the imaging principle of the human eye, and therefore are equally blind to these ubiquitous phenomena. In this talk, I will show that we can capture these hidden phenomena by creatively building novel vision systems composed of common off-the-shelf components (i.e.,...

סיבוכיות חישובית תחת אילוצי תקשורת
אבי קפלן
יום ראשון, 15.01.2023, 15:00
הרצאת זום: 95627681547 וטאוב 301
Can preprocessing help reduce computational costs? We study this question in the context of communication complexity, focusing on a simple "simultaneous messages" setting in which computationally unbounded Alice and Bob each send a single message to a computationally bounded Carol. A big part of our work concentrates on the task of computing the inner product function modulo 2 by a polynomial-sized bounded-depth Boolean circuit. Without preprocessing this task was shown to be impossible, and ...

מודלים חדשים וחסמים משופרים לאופטימיזציה מקוונת
דוד נאורי
יום ראשון, 15.01.2023, 15:00
הרצאת זום: 91014628593 וטאוב 401.
We extend the standard online worst-case model to accommodate past experience which is available to the online player in many practical scenarios. We do this by revealing a random sample of the adversarial input to the online player ahead of time. The online player competes with the expected optimal value on the part of the input that arrives online. Our model bridges between existing online stochastic models (e.g., items are drawn i.i.d. from a distribution) and the online worst-case model. ...

Coding Theory: The Generalized Covering Radius of Codes
דור אלימלך (אונ' בן-גוריון)
יום ראשון, 15.01.2023, 14:30
טאוב 601
The generalized covering radius (GCR) was recently introduced as a fundamental property of linear codes, shown to characterize a trade-off between storage amount, access complexity, and latency in linear data querying protocols (such as many PIR protocols). In the general case (where the codes are not necessarily linear), the GCR is used in order to formulate a higher-order version of the famous combinatorial football-pool problem. During this talk, we shall discuss the equivalent definitions an...

בנאים מבוססי נקודת גרעין עבור גיאומטריה בוליאנית ומסורגלת
היתם פדילה
יום ראשון, 15.01.2023, 13:30
הרצאת זום: 95299541427 וטאוב 301
Boolean sum and ruling are two well-known construction operators for both parametric surfaces and trivariates. In many cases, the input freeform curves in R^2 or surfaces in R^3 are complex, and as a result, these construction operators might fail to build the parametric geometry so that it has positive Jacobian throughout the domain. In this work, we focus on cases in which those constructors fail to build parametric geometries with a positive Jacobian throughout while the freeform input ...

Theory Seminar: A Graph Theoretic Approach for Resilient Distributed Algorithms
מרב פרטר ( מכון ויצמן למדע)
יום חמישי, 12.01.2023, 12:30
טאוב 201
Following the immense recent advances in distributed networks, the explosive growth of the Internet, and our increased dependency on these infrastructures, guaranteeing the uninterrupted operation of communication networks has become a major objective in network algorithms. The modern instantiations of distributed networks, such as the Bitcoin network and cloud computing, introduce new security challenges that deserve urgent attention in both theory and practice. In this talk, I will present ...

CS Guest Lecture: Automatic Parallelization for Concurrent Programming – Past, Present, and Future
ראם הראל (Head of Algorithms, NRCN)
יום חמישי, 12.01.2023, 10:30
Zoom Lecture: 95409713968
Introducing parallelism to applications is a complex and tedious task. As a result, the field named automatic parallelization emerged. Automatic parallelization refers to the seamless introduction of parallel schemes (such as OpenMP directives) to code. In other words, creating a tool that will mimic the human comprehension process to insert parallelization schemes. In the recent past, the main focus of this field was on creating deterministic tools such as specific functionality embedded in com...

Coding Theory: Capacity of Private Information Retrieval from Coded and Colluding Servers
Prof. Camilla Hollanti (Aalto University, Finland)
יום רביעי, 11.01.2023, 16:30
הרצאת זום: 98686325633
Private information retrieval (PIR) addresses the question of how to retrieve data items from a database or cloud without disclosing information about the identity of the data items retrieved. The area has received renewed attention in the context of PIR from coded storage. Here, the files are distributed over the servers according to a storage code instead of mere replication. Alongside with the basic principles of PIR, we will review recent capacity results and demonstrate the usefulness of th...

Theory Seminar: Efficient approximation for budgeted matroid independent set, budgeted matching, and budgeted matroid intersection
אילן דורון-ארד (המחשב, טכניון)
יום רביעי, 11.01.2023, 12:30
טאוב 201
Abstract: We consider the budgeted matroid independent set problem. The input is a ground set, where each element has a cost and a non-negative profit, along with a matroid over the elements and a budget. The goal is to select a subset of elements which maximizes the total profit subject to the matroid and budget constraints. Several well known special cases, where we have, e.g., a uniform matroid and a budget, or no matroid constraint (i.e., the classic knapsack problem), admit a fully polynomi...

סדנת Open Source
יום שלישי, 10.01.2023, 18:30
טאוב 337
הנכם מוזמנים לסדנת Open Source על קוד פתוח ואיך תרומה לקוד פתוח עוזרת להתפתחות מקצועית ולצבירת ניסיון בכל שלב בקריירה, בהרצאה מפי מיכל פורג, מפתחת front end בחברת Gong ומנהלת את קהילת הקוד הפתוח הגדולה בישראל, Pull Request, ביום שלישי, 10 בינואר, 2023, בשעה 18:30 בטאוב 337. ...

CS Colloquia: Fear Not, Vote Truthfully: Secure E-Voting Protocols for Score-and Order-Based Rules
תמיר טסה (האונ' הפתוחה)
יום שלישי, 10.01.2023, 14:30
טאוב 337
Electronic voting systems are essential for holding virtual elections, and the need for such systems increases due to the COVID-19 pandemic and the social distancing that it mandates. One of the main challenges in e-voting systems is to secure the voting process: namely, to certify that the computed results are consistent with the cast ballots, and that the privacy of the voters is preserved. We propose secure voting protocols for elections that are governed by two central families of voting rul...

יום זרקור של חברת VAYYAR
יום שלישי, 10.01.2023, 12:30
קומת הכניסה, בניין טאוב למדעי המחשב
נציגי חברת VAYYAR יגיעו לפקולטה להציג מוצרים ופיתוחים ולהציע משרות פתוחות, ביום רביעי, 11 בינואר, 2023, 12:30, לובי טאוב....

Pixel Club: Neural Volume Super-Resolution
יניב בהט (פרינסטון ואונ' סייגון)
יום שלישי, 10.01.2023, 11:30
טאוב 337
Neural volumetric representations have become a widely adopted model for radiance fields in 3D scenes. These representations are fully implicit or hybrid function approximators of the instantaneous volumetric radiance in a scene, which are typically learned from multi-view captures of the scene. We investigate the new task of neural volume super-resolution - rendering high-resolution views corresponding to a scene captured at low resolution. To this end, we propose a neural super-resolution netw...

CS Lecture: Fast Algorithms for Complex Environments
עומרי בן-אליעזר (MIT)
יום שלישי, 10.01.2023, 10:30
טאוב 601
Our modern life is marked by continuous interaction with huge and complex computational environments, a setting which gives rise to numerous theoretical and algorithmic challenges. Algorithms nowadays are often required to optimize objectives that may be theoretically ill-defined, on big data that is complex-structured, while maintaining computational efficiency and provable guarantees such as privacy and robustness. In this talk I will discuss some of my work developing new computational models...

אופטימיזציה תת מודולרית
עמית גנץ
יום חמישי, 05.01.2023, 14:30
הרצאת זום: 94984580239
We consider the online Submodular Welfare problem. In this problem we are given n bidders each equipped with a submodular utility and m items that arrive online. The goal is to assign each item, once it arrives, to a bidder or discard it, while maximizing the sum of utilities. The case of monotone utilities has attracted much attention, however much less is known once utilities are general and not necessarily monotone. When an adversary determines the items' arrival order, we presen...

Theory Seminar: Mutual Empowerment between Circuit Obfuscation and Circuit Minimization
איליה וולקוביץ (Boston College)
יום רביעי, 04.01.2023, 12:30
טאוב 201
We study close connections between Indistinguishability Obfuscation (IO) and the Minimum Circuit Size Problem (MCSP), and argue that algorithms for one of MCSP or IO would empower the other one. Some of our main results are: If there exists a perfect (imperfect) IO that is computationally-secure against non-uniform polynomial-size circuits, then we obtain fixed-polynomial lower bounds against NP(MA). In addition, computationally-secure IO against non-uniform polynomial-size circuits imply ...

יום זרקור וסדנה של חברת אינטל
יום רביעי, 04.01.2023, 12:30
קומת הכניסה, בניין טאוב למדעי המחשב
חברת אינטל תקיים יום זרקור ותציג אפשרויות תעסוקה, וכן סדנת "פיוזן 360" של מידול, הדפסה וחוויית מייקרס בתלת-ממד, ביום רביעי, 4 בינואר החל מהשעה 12:30, 2023, בלובי טאוב. לסדנה נא להירשם מראש (מספר המקומות ...

CS Lecture: Theoretical and practical principles for designing, training, and deploying huge language models
יואב לוין (AI21 Labs)
יום רביעי, 04.01.2023, 10:30
טאוב 601
The field of natural language processing (NLP) has been advancing in giant strides over the past several years. The main drivers of this success are: (1) scaling the Transformer deep network architecture to unprecedented sizes and (2) “pretraining” the Transformer over massive amounts of unlabeled text. In this talk, I will describe efforts to provide principled guidance for the above main components and further thrusts in contemporary NLP, aimed to serve as timely constructive feedback for ...

CS Colloquia: Adventures in Computational MRI
מיכאל לוסטיג (UC Berkeley)
יום שלישי, 03.01.2023, 14:30
טאוב 337
Magnetic resonance imaging (MRI) is a powerful, ionizing-radiation-free medical imaging modality. The vast physical and physiological parameters, which MRI is sensitive to, makes it possible to visualize both structure and function in the body. However the prolonged time necessary to capture the information in this large parameter space remains a major limitation of this phenomenal modality, which the field of computational MRI aims to address. By computational MRI we refer to the joint optimiza...

CS Lecture: Data Tools for Accelerated Scientific Discoveries
ברית יונגמן (CSAIL MIT)
יום שלישי, 03.01.2023, 11:00
Taub 601
Causal inference is fundamental to empirical research in natural and social sciences and is essential for scientific discoveries. Two key challenges for conducting causal inference are (i) acquiring all attributes required for the analysis, and (ii) identifying which attributes should be included in the analysis. Failing to include all necessary attributes may lead to false discoveries and erroneous conclusions. However, in real-world settings, analysts may only have access to partial data. Furt...

Yahoo Research במדעי המחשב
יום שלישי, 03.01.2023, 10:30
מועדון משתלמים, קומה 2 בבניין טאוב למדעי המשב
חברת Yahoo Research מגיעה לפקולטה למפגש ייעודי עם סטודנטים לתארים מתקדמים יום שלישי, 3 בינואר, 2023 החל מהשעה 10:30 במועדון המשתלמים, קומה 2 (בסוף המסדרון), בניין טאוב למדעי המחשב: תוכנית: 10:30 - התכנסות 11:00 - אינטרו - מרכז המחקר של יאהו ישראל 11:15 - הרצאה 1: Leveraging User Email Actions to Improve Ad-Clo...

יום זרקור של חברת מיקרוסופט
יום שני, 02.01.2023, 17:30
טאוב 9
הנכם מוזמנים ליום זרקור של חברת מיקרוסופט, למפגש שאלות ותשובות עם צוות הגיוס על תהליך הגיוס בחברה, ולהרצאה מפי נועה ברמן, מפתחת תוכנה ב-Microsoft Security, בנושא: Ransomware attacks and how we defend against them at Microsoft Defender for Endpoint, ביום שני, 2 בינואר, 17:30, בטאוב 9. נא...