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

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

Taub 201
event speaker icon
שראל כהן (המכללה האקדמית תל-אביב)
event date icon
יום רביעי, 28.02.2024, 12:15
event location icon
טאוב 201
Theory Seminar: An f-edge fault-tolerant distance sensitivity oracle (f-DSO) is a data-structure that, when queried with two vertices (s, t) and a set F of at most f edges of a graph G with n vertices, returns an estimate tilde{d}(s,t,F) of the distance d(s,t,F) from s to t in G – F. The oracle has stretch alpha if the estimate satisfies d(s,t,F) le tilde{d}(s,t,F) le alpha cdot d(s,t,F) . In the last two decades, extensive research has focused on developing efficient f-DSOs. This research aim...
[ לנוסח המלא ]

יום זרקור לחברת אנבידיה בטכניון
event date icon
יום רביעי, 28.02.2024, 12:30
event location icon
קומת הכניסה, בניין טאוב למדעי המחשב
יום זרקור לחברת אנבידיה בטכניון ב-28.2.24 אנבידיה מגיעה לפגוש את הסטודנטים והסטודנטיות של הפקולטה למדעי המחשב בטכניון! בואו לפגוש את מהנדסי ומהנדסות החברה פנים מול פנים יום רביעי 28.2.24 | 12:30-14:30 | לובי טאוב, קומה 0...
[ לנוסח המלא ]

שיכון וקטורי יציב עבור מסדי נתונים דינמיים
event speaker icon
נטע פרידמן
event date icon
יום חמישי, 29.02.2024, 15:00
event location icon
הרצאת זום: 99751665591
We study the problem of computing an embedding of the tuples of a relational database in a manner that is extensible to dynamic changes of the database. In this problem, the embedding should be stable in the sense that it should not change on the existing tuples due to the embedding of newly inserted tuples (as database applications might already rely on existing embeddings); at the same time, the embedding of all tuples, old and new, should retain high quality. This task is challenging since in...
[ לנוסח המלא ]

סיווג מוקדם עם שליטה על פער הדיוק המצטבר
event speaker icon
לירן רינגל
event date icon
יום שלישי, 05.03.2024, 15:00
event location icon
הרצאת זום: 96835343656 וטאוב 401
Early time classification algorithms aim to label a stream of features without processing the full input stream, while maintaining accuracy comparable to that achieved by applying the classifier to the entire input. In this paper, we introduce a statistical framework that can be applied to any sequential classifier, formulating a calibrated stopping rule. This data-driven rule attains finite-sample, distribution-free control of the accuracy gap between full and early-time classification. We star...
[ לנוסח המלא ]

יום מחקר 2024 בפקולטה למדעי המחשב
event date icon
יום רביעי, 03.04.2024, 12:30
event location icon
קומת הכניסה, בניין טאוב למדעי המחשב
יום המחקר העשירי לתארים מתקדמים בפקולטה למדעי המחשב יתקיים ביום רביעי, 03 באפריל 2024, בין השעות 12:30-14:30, בלובי של בניין טאוב למדעי המחשב. יום מחקר הוא הזדמנות עבור משתלמי הפקולטה להציג את מחקריהם באמצעות פוסטרים ומצגות בפני אנשי סגל ומנהלים בכירים בטכניון ותלמידים לכל ...
[ לנוסח המלא ]

TDC Seminar: Fast and Fair Lock-Free Locks
event speaker icon
נעמה בן-דוד, טכניון
event date icon
יום שני, 26.02.2024, 13:30
event location icon
זיסאפל (הנדסת חשמל ומחשבים) חדר 608
Locks are frequently used in concurrent systems to simplify code and ensure safe access to contended parts of memory. However, they are also known to cause bottlenecks in concurrent code, leading practitioners and theoreticians to sometimes opt for more intricate lock-free implementations. In this talk, I’ll show that, despite the seeming contradiction, it is possible to design practically and theoretically efficient lock-free locks; I'll present a lock-free lock algorithm with good bounds on ...
[ לנוסח המלא ]

Fundamental Problems in AI: Transferability, Compressibility and Generalization
event speaker icon
תומר גלנטי
event date icon
יום חמישי, 22.02.2024, 15:00
event location icon
הרצאת זום: 9316005503 סיסמה: 272625
In this talk, we delve into several fundamental questions in deep learning. We start by addressing the question, "What are good representations of data?" Recent studies have shown that the representations learned by a single classifier over multiple classes can be easily adapted to new classes with very few samples. We offer a compelling explanation for this behavior by drawing a relationship between transferability and an emergent property known as neural collapse. Later, we explore why certain...
[ לנוסח המלא ]

תאוריה ופרקטיקה של זכרונות דנ״א
event speaker icon
דניאלה בר-לב
event date icon
יום רביעי, 21.02.2024, 17:00
event location icon
הרצאת זום: 92916633492 וטאוב 9
In the last decade, DNA-based storage systems emerged as a potential data archival solution due to their high data density and durability. This research delves into intrinsic error characteristics of DNA storage systems to devise robust coding strategies and innovative algorithms for enhanced reliability, efficiency, scalability, and cost-effectiveness. The research propels DNA storage feasibility while contributing to foundational theory.The work analyzes combinatorial structures tied t...
[ לנוסח המלא ]

Identifying Underlying Geometry To Analyze High-Dimensional Data: Images And Shape Spaces As A Case Study
event speaker icon
שירה פייגנבוים-גולובין
event date icon
יום רביעי, 21.02.2024, 15:00
event location icon
הרצאת זום: 93613579310 סיסמה: 652820
High-dimensional data is increasingly available in diverse applications, ranging from images to shapes represented as point clouds. Such data raises novel questions and offers a unique opportunity to study them by developing new machine-learning tools. While the analysis of an individual sample may be challenging, leveraging the power of the data collection can be effective in tackling complex tasks. This talk delves into the challenges associated with studying such data, particularly focusing o...
[ לנוסח המלא ]

Theory Seminar: IOPs with Inverse Polynomial Soundness Error
event speaker icon
גל ארנון (מכון ויצמן)
event date icon
יום רביעי, 21.02.2024, 12:15
event location icon
טאוב 201
We show that every language in NP has an Interactive Oracle Proof (IOP) with inverse polynomial soundness error and small query complexity. This achieves parameters that surpass all previously known PCPs and IOPs. Specifically, we construct an IOP with perfect completeness, soundness error 1/n, round complexity O(loglog n), proof length poly(n) over an alphabet of size O(n), and query complexity O(loglog n). This is a step forward in the quest to establish the sliding-scale conjecture for IOPs (...
[ לנוסח המלא ]

TDC Seminar: Deterministic Distributed Maximum Weight Independent Set Approximation in Sparse Graphs
event speaker icon
יובל גיל (טכניון)
event date icon
יום שני, 19.02.2024, 13:30
event location icon
זיסאפל (הנדסת חשמל ומחשבים) חדר 608
This talk focuses on the distributed task of constructing an approximate \emph{maximum weight independent set (MWIS)}. Specifically, we are interested in deterministic CONGEST algorithms whose approximation guarantees are expressed as a function of the graph's \emph{arboricity} $\alpha$.Generally speaking, efficient deterministic non-trivial approximation algorithms for MWIS were not known until the recent breakthrough of Faour et al.~[SODA 2023] that obtained an $O(\Delta)$-approximatio...
[ לנוסח המלא ]

פלטפורמת למידה עמוקה לאבחון בדיקות אק״ג
event speaker icon
עידן לוי
event date icon
יום חמישי, 15.02.2024, 11:00
event location icon
הרצאת זום: קישור  וטאוב 401
In clinical settings, a significant portion of ECG data is typically available in printed form, and the most convenient means of digitizing this information involves utilizing a mobile device. Despite notable progress in AI-based techniques for paper-based 12-lead ECG analysis, their adoption in clinical practice remains limited primarily due to challenges such as inadequate accuracy in clinical settings and a restricted ability to diagnose various cardiac conditions. Our objective was to tackle...
[ לנוסח המלא ]

Theory Seminar: Optimal Prediction Using Expert Advice and Randomized Littlestone Dimension
event speaker icon
עידן מהלל (טכניון)
event date icon
יום רביעי, 14.02.2024, 12:15
event location icon
טאוב 201
Suppose that n forecasting experts (or functions) are providing daily rain/no-rain predictions, and the best among them is mistaken in at most k many days. For how many days will a person allowed to observe the predictions, but has no weather-forecasting prior knowledge, mispredict?In this talk, we will discuss how such classical problems can be reduced to calculating the (average) depth of binary trees, by using newly introduced complexity measures (aka dimensions) of the set of experts...
[ לנוסח המלא ]

ceClub: Space-efficient FTL for Mobile Storage via Tiny Neural Nets
event speaker icon
רון מרקוס
event date icon
יום רביעי, 14.02.2024, 11:30
event location icon
מאייר 861
With the rapid increase of storage demands and working sets of modern mobile apps, maintaining high I/O performance in mobile SSDs under strict resource constraints is challenging. The Flash Translation Layer (FTL) must increase the capacity of the Logical-To-Physical (L2P) address translation cache to keep up with the new workloads, but it comes at the cost of scaling the on-die SRAM, resulting in higher chip area, power consumption, and costs.In this talk, I will present RQFTL, a deman...
[ לנוסח המלא ]

קבוצת CTF טכניון
event date icon
יום שלישי, 13.02.2024, 18:30
event location icon
טאוב 2
בואו להיות חלק מקבוצת Capture The Flag-CTF חדשה בפקולטה המפגשים מתקיימים מדי יום ג' בשעה 18:30 בטאוב 9 וכוללים הרצאות אורח והתנסות מעשית בפתרון אתגרים. כולם מוזמנים! מתחילים ובעלי ניסיון לפרטים: Technionctf.com השבוע 13.2.24: 18:30 | טאוב 2 | עומר אטיאס - ...
[ לנוסח המלא ]

מאזן עומס ל QUIC המודע ל- 0-RTT
event speaker icon
רוברט שהלה
event date icon
יום שני, 12.02.2024, 12:00
event location icon
הרצאת זום: 97318309550 וטאוב 601
QUIC is an emerging transport protocol, offering multiple advantages over TCP. Yet, to fully unleash QUIC’s potential, a paradigm shift is needed in existing network infrastructure. We propose a novel 0-RTT-aware load balancing algorithm. 0-RTT is crucial for web performance, particularly on mobile networks. Our load balancing algorithm ensures 0-RTT while maintaining near-optimal load balancing performance.Through extensive simulations, using both synthetic and real-world traffic trac...
[ לנוסח המלא ]

יום זרקור פיינל
event date icon
יום רביעי, 07.02.2024, 12:30
event location icon
אודיטוריום 012, קומה 0
מוזמנים ליום זרקור של חברת פיינל יום רביעי 07.02.2024 | 12:30-14:30 | אודיטוריום מרכז המבקרים 012, קומה 0 12:30 - בואו לפגוש מהנדסים, חוקרים ואת צוות הגיוס בפיינל, ולהכיר את היום יום בפיינל. 13:15 - מפגש על אופציות, הסתברויות ועולם האלגוטריידינג | נועם הורוביץ - חו...
[ לנוסח המלא ]

Theory Seminar: Algorithmic Cheap Talk
event speaker icon
קונסטנטין זברני
event date icon
יום רביעי, 07.02.2024, 12:15
event location icon
טאוב 201
בואו להיות חלק מקבוצת Capture The Flag-CTF חדשה בפקולטה המפגשים מתקיימים מדי יום ג' בשעה 18:30 בטאוב 9 וכוללים הרצאות אורח והתנסות מעשית בפתרון אתגרים. כולם מוזמנים! מתחילים ובעלי ניסיון לפרטים: Technionctf.com השבוע 6.2.24: מתחילים: פורנזיקה & רש...
[ לנוסח המלא ]

קבוצת CTF טכניון
event date icon
יום שלישי, 06.02.2024, 18:30
event location icon
טאוב 9
בואו להיות חלק מקבוצת Capture The Flag-CTF חדשה בפקולטה המפגשים מתקיימים מדי יום ג' בשעה 18:30 בטאוב 9 וכוללים הרצאות אורח והתנסות מעשית בפתרון אתגרים. כולם מוזמנים! מתחילים ובעלי ניסיון לפרטים: Technionctf.com השבוע 6.2.24: מתחילים: פורנזיקה & רשת...
[ לנוסח המלא ]

אי השתנות כבעיית תכן
event speaker icon
אלעד קינסברונר
event date icon
יום שלישי, 06.02.2024, 12:30
event location icon
טאוב 601
Many object-oriented applications in algorithm design rely on objects never changing during their lifetime. This is often tackled by marking object references as read-only, e.g., using the const keyword in C++. In other languages like Python or Java where such a concept does not exist, programmers rely on best practices that are entirely unenforced. While reliance on best practices is obviously too permissive, const-checking is too restrictive: it is possible for a method to mutate the internal ...
[ לנוסח המלא ]

Pixel-Club: Robustified ANNs Reveal Wormholes Between Human Category Percepts
event speaker icon
גיא גזיב (מעבדת דיקרלו ב-MIT)
event date icon
יום שלישי, 06.02.2024, 11:30
event location icon
חדר 1061, בניין מאייר, הפקולטה להנדסת חשמל
The visual object category reports of artificial neural networks (ANNs) are notoriously sensitive to tiny, adversarial image perturbations. Because human category reports (aka human percepts) are thought to be insensitive to those same small-norm perturbations — and locally stable in general — this argues that ANNs are incomplete scientific models of human visual perception. Consistent with this, we show that when small-norm image perturbations are generated by standard ANN models, human obj...
[ לנוסח המלא ]

Theory Of Crypto Seminar: Perfect Asynchronous MPC with Linear Communication Overhead
event speaker icon
גלעד אשרוב (אוניברסיטת בר אילן)
event date icon
יום חמישי, 01.02.2024, 11:30
event location icon
טאוב 4001
We study secure multiparty computation in the asynchronous setting with perfect security and optimal resilience (less than one-fourth of the participants are malicious). It has been shown that every function can be computed in this model [Ben-OR, Canetti, and Goldreich, STOC'1993]. Despite 30 years of research, all protocols in the asynchronous setting require $\Omega(n^2C)$ communication complexity for computing a circuit with $C$ multiplication gates. In contrast, for nearly 15 years, in the ...
[ לנוסח המלא ]

אלגוריתמי קירוב לבעיות סידור של גרפים
event speaker icon
דור קצלניק
event date icon
יום רביעי, 31.01.2024, 12:30
event location icon
טאוב 201
We study several graph layout problems with a min max objective. Here, given a graph we wish to find a linear ordering of the vertices that minimizes some worst case objective over the natural cuts in the ordering; which separate an initial segment of the vertices from the rest. A prototypical problem here is cutwidth, where we want to minimize the maximum number of edges crossing a cut. The only known algorithm here is by [Leighton-Rao J.ACM 99] based on recursively partitioning the graph using...
[ לנוסח המלא ]

Theory Seminar: Almost Logarithmic Approximation for Cutwidth and Pathwidth
event speaker icon
דור קצלניק (טכניון)
event date icon
יום רביעי, 31.01.2024, 12:15
event location icon
טאוב 201
We study several graph layout problems with a min max objective. Here, given a graph we wish to find a linear ordering of the vertices that minimizes some worst case objective over the natural cuts in the ordering; which separate an initial segment of the vertices from the rest. A prototypical problem here is cutwidth, where we want to minimize the maximum number of edges crossing a cut. The only known algorithm here is by [Leighton-Rao J.ACM 99] based on recursively partitioning the graph using...
[ לנוסח המלא ]

ceClub: Challenges and Opportunities In Securing Software Supply Chains
event speaker icon
ד"ר יניב דוד (אוניברסיטת קולומביה)
event date icon
יום רביעי, 31.01.2024, 11:30
event location icon
מאייר 861
Racing to be first to market and deploy new features, developers rely on many external libraries to underpin their software. Each library uses more libraries, creating vast networks of dependencies that the developers know little about and have no control over, forming a knowledge gap that quickly turns into technical debt. Repaying this debt is difficult, as analyzing or examining all libraries is infeasible, and worse, the debt keeps growing due to frequent library updates. Attackers move quic...
[ לנוסח המלא ]

CS Lecture: On Implicit Bias and Benign Overfitting in Neural Networks
event speaker icon
גל ורדי
event date icon
יום רביעי, 31.01.2024, 10:30
event location icon
טאוב 601
When training large neural networks, there are typically many solutions that perfectly fit the training data. Nevertheless, gradient-based methods often have a tendency to reach those which generalize well, namely, perform well also on test data. Thus, the training algorithm seems to be implicitly biased towards certain networks, which exhibit good generalization performance. Understanding this “implicit bias” has been a subject of extensive research recently. Moreover, in contradiction to c...
[ לנוסח המלא ]

עדשת דיפוזיה: תפקיד קידוד הטקסט במודלי טקסט לתמונה
event speaker icon
מיכאל טוקר
event date icon
יום שני, 29.01.2024, 15:30
event location icon
טאוב 601
Text-to-image diffusion models (T2I) use a latent representation of a text prompt to guide the image generation process. However, the encoder that produces the text representation is largely unexplored. We propose the Diffusion Lens, a method for analyzing the text encoder of T2I models by generating images from its intermediate representations. Using the Diffusion Lens, we perform an extensive analysis of two recent T2I models.We find that the text encoder gradually builds prompt repres...
[ לנוסח המלא ]

CS Lecture: Verification of Complex Hyperproperties
event speaker icon
הדר פרנקל
event date icon
יום ראשון, 28.01.2024, 10:30
event location icon
אודיטוריום 012, קומה 0
Hyperproperties are system properties that relate multiple execution traces to one another. Hyperproperties are essential to express a wide range of system requirements such as information flow and security policies; epistemic properties like knowledge in multi-agent systems; fairness; and robustness. With the aim of verifying program correctness, the two major challenges are (1) providing a specification language that can precisely express the desired properties; and (2) providing scalable veri...
[ לנוסח המלא ]

Theory Seminar: The Sample Complexity Of ERMs In Stochastic Convex Optimization
event speaker icon
דניאל כרמון (טכניון)
event date icon
יום רביעי, 24.01.2024, 12:15
event location icon
טאוב 201
Stochastic convex optimization is one of the most well-studied models for learning in modern machine learning. Nevertheless, a central fundamental question in this setup remained unresolved: How many data points must be observed so that any empirical risk minimizer (ERM) shows good performance on the true population? This question was proposed by Feldman who proved that Ω(\frac{d}{ϵ} + \frac{1}{ϵ^2}) data points are necessary (where d is the dimension and ε > 0 is the accuracy parameter). P...
[ לנוסח המלא ]

קבוצת Technion CTF Team נפתחת בפקולטה
event date icon
יום שלישי, 23.01.2024, 18:30
event location icon
טאוב 9
קבוצת Technion CTF Team נפתחת בפקולטה אנו מזמינים אתכם להצטרף למפגשי Capture The Flag - CTF .CTF היא תחרות אתגרי סייבר ואבטחת מידע בנושאים: קריפטוגרפיה, הנדסה לאחור, פורנזיקה, ווב וכיוצ"ב. המפגשים יכללו הרצאות אורח והתנסות מעשית בפתרון אתגרים. מוזמנים להצטרף סטודנטים מתחילים וסטוד...
[ לנוסח המלא ]

CGGC Seminar: Poisson Manifold Reconstruction (beyond co-dimension one)
event speaker icon
פרופ' מישה קז'דן (מדעי המחשב, אוניברסיטת ג'ונס הופקינס)
event date icon
יום חמישי, 18.01.2024, 11:30
event location icon
טאוב 012 (אודיטוריום, מרכז רב תכליתי)
In this talk we consider the problem of manifold reconstruction from oriented point clouds for embedded manifolds of co-dimension larger than one. Using the framework of Poisson Surface Reconstruction, and formulating the problem in the language of alternating products, we show that the earlier approach for reconstructing hyper-surfaces extends to general manifolds, at the cost of replacing a quadratic energy with a multi-quadratic energy. We provide an efficient iterative hierarchical solver th...
[ לנוסח המלא ]

Taub 201
event speaker icon
דוד וייץ (טכניון)
event date icon
יום רביעי, 17.01.2024, 12:15
event location icon
טאוב 201
Vizing’s Theorem provides an algorithm that edge colors any graph of maximum degree Δ using Δ+1 colors, which is necessary for some graphs, and at most one higher than necessary for any graph. In online settings, the trivial greedy algorithm requires 2Δ-1 colors, and Bar-Noy, Motwani and Naor in the early 90s showed that this is best possible, at least in the low-degree regime. In contrast, they conjectured that for graphs of superlogarithmic-in-n maximum degree, much better can be done, an...
[ לנוסח המלא ]

Internet-Scale Consensus in the Blockchain Era
event date icon
יום שלישי, 16.01.2024, 11:00
event location icon
טאוב 601
Blockchains have ignited interest in Internet-scale consensus as a vital building block for decentralized applications and services that promise egalitarian access and robustness to faults and abuse. While the study of consensus has a 40+ year tradition, the new Internet-scale setting requires a fundamental rethinking of models, desiderata, and protocols. An emergent key challenge is to simultaneously serve clients with different requirements regarding the two fundamental aspects of security, li...
[ לנוסח המלא ]

סיווג של אק"ג מ 12 חיבורים באמצעות שיטות של למידה עמוקה
event speaker icon
ודים גלינר
event date icon
יום חמישי, 04.01.2024, 12:30
event location icon
הפקולטה להנדסה ביו-רפואית, בניין סילבר, חדר 201
12-lead electrocardiogram (ECG) recordings can be collected in any clinic and the interpretation is performed by a clinician. Modern machine learning tools may make them automatable. However, a large fraction of 12-lead ECG data is still available in printed paper or image only and comes in various formats. To digitize the data, smartphone cameras can be used. Nevertheless, this approach may introduce various artifacts and occlusions into the obtained images.Here, I will present 5 papers...
[ לנוסח המלא ]

Auditorium 012, floor 0
event speaker icon
יובל דגן
event date icon
יום שני, 01.01.2024, 10:30
event location icon
אודיטוריום 012, קומה 0
I will present a theoretical framework for analyzing learning algorithms which rely on dependent, rather than independent, observations. While a common assumption is that the learning algorithm receives independent datapoints, such as unrelated images or texts, this assumption often does not hold. An example is data on opinions across a social network, where opinions of related people are often correlated, for example as a consequence of their interactions. I will present a line of work that mod...
[ לנוסח המלא ]