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

We study the efficient enumeration of fixed polycubes in dimensions three and higher, a central problem in enumerative combinatorics with exponential growth. Building on Redelmeier’s recursive framework and later refinements that replace a full recursion with combinatorial counting, we introduce an optimization for the terminal levels of the computation tree. The key insight is tha...
[ לנוסח המלא ]

Understanding how large language models store, retain, and remove knowledge is critical for interpretability, reliability, and compliance with privacy regulations.My work introduces a geometric perspective on memorization and unlearning by analyzing loss behavior over semantically similar inputs through the Input Loss Landscape. I show that retained, forgotten, and unseen examples exhibit distinct patterns that reflect active learning, suppressed knowledge, and ignored information...
[ לנוסח המלא ]

Dominating Set is a fundamental problem in graph theory: given a graph, find a minimum-weight subset of vertices such that every vertex is either selected or shares an edge with a selected vertex. In online settings where vertices arrive sequentially, comparing algorithms against an offline optimum with full knowledge of the input leads to extremely strong lower bounds, where even a simple star graph shows that any online algorithm must have competitive ratio Ω(n), with n being ...
[ לנוסח המלא ]

Cloud computing is now extremely common, and many organizations operate workloads across multiple providers. As a result, cross-cloud data transfer has become a critical requirement in modern distributed systems. New services such as Google Cross-Cloud Interconnect (CCI) offer dedicated, high-throughput links with low per-GB transfer costs. Yet these benefits come with high fixed leasing fees and a provisioning delay of several days, creating a difficult cost-performance trade-off under unkno...
[ לנוסח המלא ]

Graduate seminar on Distributed and Decentralized Task Allocation in Flexible Swarms by Yigal Koifman, supervised by Prof. Alfred M. Bruckstein and Dr. Ariel Barel. Multi-agent systems provide a powerful platform for solving complex tasks in dynamic environments, yet achieving coordination without centralized control or direct communication remains a core challenge. This seminar will present a unified, scalable, and robust framework for distributed task allocation that emerges solely ...
[ לנוסח המלא ]

Lossless vertex expanders are d-regular (or biregular) graphs in which every small set of vertices S has almost the largest possible number of neighbors d|S|. While random regular graphs are known to be lossless expanders with high probability, constructing them explicitly has been a longstanding challenge.  In this talk, I will present the first explicit construction of constant-degree two-sided lossless vertex expanders. The resulting graphs also admit a free group action, and ...
[ לנוסח המלא ]

We introduce a vision-guided robotic system for automated saffron flower harvesting. Using camera-based perception and robotic manipulation, the system detects and cuts whole flowers while preserving their stigmas and avoiding plant damage....
[ לנוסח המלא ]

המפגש יתקיים ביום שני 19.1 בשעה 18:30, בטאוב 7 למתחילים ובטאוב 8 למתקדמים כולם מוזמנים, גם בלי ניסיון קודם – מחכים לראות אתכם!  במה נתעסק?  רוצים לאתגר את עצמכם באמת? תחרות CTF היא הדרך הכי כיפית ללמוד סייבר: פותרים חידות אמיתיות, חושבים כמו האקר...
[ לנוסח המלא ]

Ensuring that AI systems behave as intended is a central challenge in contemporary AI. This talk offers an exposition of provable mathematical guarantees for learning and security in AI systems. Starting with a classic learning-theoretic perspective on generalization guarantees, we present two results quantifying the amount of training data that is provably necessary and sufficient for learning: (1) In online learning, we show that access to unlabeled data can reduce the number of pre...
[ לנוסח המלא ]

We present ReHub, a novel graph transformer architecture that achieves linear complexity through an efficient reassignment technique between nodes and virtual nodes. Graph transformers have become increasingly important in graph learning for their ability to utilize long-range node communication explicitly, addressing limitations such as oversmoothing and oversquashing found in message-passing graph networks. However, their dense attention mechanism scales quadratically with the number o...
[ לנוסח המלא ]

The field of artificial intelligence (AI) is undergoing a paradigm shift, moving from neural networks trained for narrowly defined tasks (e.g., image classification and machine translation) to general-purpose models such as ChatGPT. These models are trained at unprecedented scales to perform a wide range of tasks, from providing travel recommendations to solving Olympiad-level math problems. As they are increasingly adopted in society, a central challenge is to ensure the alignment of general...
[ לנוסח המלא ]

Large Language Models (LLMs) have transformed what machines can do and how systems are designed to serve them. These models are both computationally and memory demanding, revealing the limits of traditional optimization methods that once sufficed for conventional systems. A central challenge in building LLM systems is improving system metrics while ensuring response quality.This talk presents approaches for reducing latency in LLM systems to support interactive applications, from scheduli...
[ לנוסח המלא ]

חברת Amazon מגיעה לפגוש אתכם בטכניון! יום רביעי 14/1 ב-12:30 באודיטוריום פסנתר בטאוב, הפקולטה למדעי המחשב. בתוכנית (יש להרשם מראש): 12:30   מינגלינג עם צוותי הפיתוח | לובי טאוב 12:45   הרצאות טכנולוגיות על המוצרים והטרנדים החמים ב�...
[ לנוסח המלא ]

"טכניון על הבר" חודש ינואר - והפעם: למידת מכונה בעולם אנושי מערכות לומדות כבר נמצאות בכל מקום ומשפיעות על חיי היום-יום שלנו אבל האם הן באמת מותאמות לאנשים? בהרצאה מרתקת ייקח אותנו ד"ר ניר רוזנפלד אל האתגרים, ההבטחות, וגם הניסיונות הראשונים (המוצלחים �...
[ לנוסח המלא ]

המפגש יתקיים ביום שני 12.1 בשעה 18:30, בטאוב 9 למתחילים ובטאוב 8 למתקדמים. ומפגש נוסף בעקבות הביקוש ביום שלישי 13.1 בשעה 17:30 בטאוב 3 למתקדמים וטאוב 7 למתקדמים כולם מוזמנים, גם בלי ניסיון קודם - מחכים לראות אתכם!  במה נתעסק?  ...
[ לנוסח המלא ]

3D geometry powers design, perception, and simulation across various domains, including healthcare, transportation, manufacturing, and entertainment. Yet, traditional workflows for creating and editing 3D content are largely inaccessible, requiring expert knowledge and extensive manual effort. Recent advances in deep learning have enabled the generation of 3D assets through simple interfaces, such as natural language prompts. However, these AI models provide limited control, making it hard to...
[ לנוסח המלא ]

Large Language Models (LLMs) have transformed what machines can do and how systems are designed to serve them. These models are both computationally and memory demanding, revealing the limits of traditional optimization methods that once sufficed for conventional systems. A central challenge in building LLM systems is improving system metrics while ensuring response quality. This talk presents approaches for reducing latency in LLM systems to support interactive applications, from sch...
[ לנוסח המלא ]

We introduce a distributed computational model referred to as the \emph{uniform port} model.An algorithm operating in this model is defined by means of local automata associated with the ports (a.k.a. half-edges) of the input graph.The crux of the uniform port model is that the local automata are identical and admit a constant size description, making the model \emph{truly uniform}.Moreover, since the new model explicitly supports the assignment of (input and) output labels to the...
[ לנוסח המלא ]

The OS page cache is central to the performance of many applications, by reducing excessive accesses to storage. However, its one-size-fits-all eviction policy performs poorly in many workloads. While the systems community has experimented with new and adaptive eviction policies in non-OS settings (e.g., key-value stores, CDNs), it is very difficult to implement such policies in the kernel. To address these shortcomings, we design a flexible eBPF-based framework for the Linux page cache, call...
[ לנוסח המלא ]

Modern machine learning systems operate in regimes that challenge classical learning-theoretic assumptions. Models are highly overparameterized, trained with simple optimization algorithms, and rely critically on how data is collected and curated. Understanding the limits of learning in these settings requires revisiting both the computational and statistical foundations of learning theory. A central question in learning theory asks which functions are tractably learnable. Classical c...
[ לנוסח המלא ]

Elections are a fundamental mechanism for collective decision-making. Yet in many real-world settings, the available information is often incomplete, inconsistent, or uncertain. This thesis addresses this challenge by developing computational frameworks for analyzing election outcomes under various forms of uncertainty. Our work builds upon the established paradigm of possible and necessary winners, where the goal is to determine which candidates could or must win given partially ordered vote...
[ לנוסח המלא ]

Machine learning relies on its ability to generalize from limited data, yet a principled theoretical understanding of generalization remains incomplete. While binary classification is well understood in the classical PAC framework, even its natural extension to multiclass learning is substantially more challenging. In this talk, I will present recent progress in multiclass learning that characterizes when generalization is possible and how much data is required, resolving a long-stand...
[ לנוסח המלא ]

הרצאה של חברת  STARKWARE - ההרצאה תעסוק בנושא Proof Systems  ותתמקד בגישור הפער שבין התיאוריה ליישום בעולם האמיתי (בהובלת ד"ר גיל בן שחר וסתיו בנו).  לינק להרשמה ...
[ לנוסח המלא ]

I will present an overview of some topics in computational (and combinatorial, and a bit algebraic) geometry, that constitute milestones in the work in this area by myself and by many colleagues and (former) students in the past 45 years. The topics include, as time permits, algorithmic motion planning, arrangements, lower envelopes, incidences, space decomposition, polynomial partitioning, and more.  Bio: Micha Sharir received his Ph.D. in Mathematics from Tel A...
[ לנוסח המלא ]

בואו להיות חלק מקבוצת Capture The Flag-CTF של הטכניון!! המפגש יתקיים ביום שני 5.1 בשעה 18:30, בטאוב 9. מה במפגש?הרצאת אורח מאת אורי בר - אבטחת סייבר במערכות רכב חכמות: מנקודת מבט של תוקף אורי בר הוא חוקר אבטחה התקפית ומנהיג קבוצת הערכת אבטחה בצוות ה...
[ לנוסח המלא ]

אנחנו מתרגשות להזמין אתכן לערב של הרצאות TED עם פיצות ובירות!   אתן רגילות לפגוש אותן בתרגולים ליד הלוח אבל רוב זמנן בפקולטה מוקדש למחקר פורץ דרך, עכשיו זאת ההזדמנות שלכן לשמוע על המחקרים שלהן!הצטרפו לערב TED שיכלול 3 הרצאות קצרות ומרתקות של חוקרות מהפקולטה של�...
[ לנוסח המלא ]

In the context of Byzantine consensus problems such as Byzantine broadcast (BB) and Byzantine agreement (BA), the good-case setting aims to study the minimal possible latency of a BB or BA protocol under certain favorable conditions, namely the designated leader being correct (for BB), or all parties having the same input value (for BA). We provide a full characterization of the feasibility and impossibility of good-case latency, for both BA and BB, in the synchronous sleepy model. Surprising...
[ לנוסח המלא ]

Despite the remarkable success of modern deep learning, our theoretical understanding remains limited. Many fundamental questions about how these models learn, what they memorize, and what their architectures can express are still largely open. In this talk, I focus on two such questions that offer complementary perspectives on the behavior of modern networks. First, I examine how standard training procedures implicitly encode aspects of the training data in the learned parameter...
[ לנוסח המלא ]

From rough sketches that spark ideas to polished designs that explain complex concepts, visual communication is central to how humans think, create, and share knowledge. Yet despite major advances in generative AI, we are still far from models that can reason and communicate through visual forms.I will present my work on bridging generative models and visual communication, focusing on three complementary domains: (1) algorithms for generating and understanding sketches, (2) systems that s...
[ לנוסח המלא ]

CRISPR-Cas genome editing is a highly specific technology that enables edit operations in genomes and other DNA fragments. CRISPR-Cas as a tool in biotechnology is the result of harnessing a similar system that naturally occurs in bacteria. The technology holds promise as a component in therapy and clinical approaches. Indeed - several therapies were recently approved for use in patients. For example - Casgevy, a sickle cell anemia therapy that is showing great positive results. One of the ch...
[ לנוסח המלא ]

I will explain a phenomenon that I call the "Average Scale is Boring Principle" (you may help me come up with a better name): The 01010101... sequence, for example, has high variance on a local scale, but if you look at larger scales each segment looks identical. For another example, the sequence 0^n1^n looks different at a global scale, but on almost all short intervals it is constant. I will formalize a sense in which some sequences have high variance on some scales, but for *all* sequences...
[ לנוסח המלא ]