יום שלישי, 19.03.2024, 12:30
יאהו מקיימים מפגש ייעודי עם סטודנטים לתארים מתקדמים
יום שלישי, 19/3 ב-12:30 במועדון משתלמים
בתוכנית: היכרות עם המחקר של יאהו בישראל ותוכנית התמחויות הקיץ.
להרשמה לאירוע כאן
מחכים לכם!!
...
[ לנוסח המלא ]אדם ג'יי אביב (אוניברסיטת ג'ורג' וושינגטון)
יום רביעי, 20.03.2024, 11:30
The surveillance economy, where tracking and collecting data on uses for the purpose of advertising and other actions, is central to much of the money-making enterprises of the modern technology ecosystem. Due to regulations and other forces, some of the largest companies, such as Google and Apple, have prioritized mechanisms for users to better manage and receive information about the kinds of data that is being collected about them. In this talk, I will explore how effective these mechanisms r...
[ לנוסח המלא ]
יום רביעי, 20.03.2024, 12:30
מוזמנים ליום זרקור של חברת מובילאיי בטכניון
יום רביעי 20.3 | 12:30 | בניין טאוב...
[ לנוסח המלא ]אילן ניומן (אוניברסיטת חיפה)
יום רביעי, 20.03.2024, 13:15
A finite metric space $(X,d)$ on a set of points $X$ is just the shortest path metric $d$ on a positively weighted graph $G=(X,E)$. In the online setting, the vertices of the input finite metric space $(X,d)$ are exposed one by one, together with their distances $d(*,*)$to the previously exposed vertices. The goal is to embed (map) $X$ into a given host metric space $(H,d_H)$ (finite or not) and so to distort the distances as little as possible (distortion is the worst case ratio of how ...
[ לנוסח המלא ]אלנתן קידר (סמינר לתואר שני)
יום רביעי, 20.03.2024, 14:30
חדר 1061, בניין מאייר, הפקולטה להנדסת חשמל
We propose a new way to explain and to visualize neural network classification through a decomposition-based explainable AI.
Instead of providing an explanation heatmap, our method yields a decomposition of the image into class-agnostic and class-distinct parts, with respect to the data and chosen classifier. Following a fundamental signal processing paradigm of analysis and synthesis, the original image is the sum of the decomposed parts. We thus obtain a radically different way of explaining c...
[ לנוסח המלא ]
יום חמישי, 21.03.2024, 10:30
In this lecture we will explore collaborative caching algorithms in order to boost the effectiveness of caches in a distributed storage system. I'll introduce a scheme that partitions each node’s cache into two conceptual regions: an egoistic area whose goal is to contain the most valuable data for the node that owns the cache, and an altruistic area whose goal is to contain the most valuable data for the system as a whole. Each node’s division between these two regions is dynamically adjust...
[ לנוסח המלא ]
יום רביעי, 27.03.2024, 10:00
בניין מאייר, הפקולטה להנדסת חשמל
ה- Tech Experience של אינטל מגיע לקמפוס!
מוכנים לפיקניק הטכנולוגי הכי חדשני שראיתם אי פעם?
העמסנו כלים טכנולוגיים ואת המוחות הכי גדולים שלנו לטראק ואנחנו בדרך אליכם
יום רביעי 27.3 | בניין מאייר קומה 3
10:00 - AR | VR | HR בואו להכיר אותנו ואת הטכנולוגיות שלנו
12:30 ...
[ לנוסח המלא ]
יום חמישי, 28.03.2024, 09:30
יום פתוח ללימודים בטכניון יתקיים ביום ה' 28/3 החל מ-09:30
לפרטים והרשמה היכנסו לאתר רישום וקבלה בקישור
...
[ לנוסח המלא ]הדר אברבוך-אלור, אוניברסיטת תל-אביב
יום שלישי, 02.04.2024, 14:30
Foundation models that connect vision and language have recently shown great promise for a wide array of tasks such as text-to-image generation. Significant attention has been devoted towards utilizing the visual representations learned from these powerful vision and language models. In this talk, I will present an ongoing line of research that focuses on the other direction, aiming at understanding what knowledge language models acquire through exposure to images during pretraining. We first co...
[ לנוסח המלא ]
יום רביעי, 03.04.2024, 12:30
קומת הכניסה, בניין טאוב למדעי המחשב
יום המחקר העשירי לתארים מתקדמים בפקולטה למדעי המחשב יתקיים ביום רביעי, 03 באפריל 2024, בין השעות 12:30-14:30, בלובי של בניין טאוב למדעי המחשב.
יום מחקר הוא הזדמנות עבור משתלמי הפקולטה להציג את מחקריהם באמצעות פוסטרים בפני חברי סגל, מנהלים מהתעשייה וסטודנטים בפקולטה ומכלל הט...
[ לנוסח המלא ]גל צ'צ'יק, אוניברסיטת בר-אילן ו-NVIDIA
יום חמישי, 04.04.2024, 10:30
Between training and inference, lies a growing class of AI problems that involve fast optimization of a pre-trained model for a specific inference task. These are not pure “feed-forward” inference problems applied to a pre-trained model, because they involve some non-trivial inference-time optimization beyond what the model was trained for; neither are they training problems, because they focus on a specific input. These compute-heavy inference workflows raise new challenges in machine learn...
[ לנוסח המלא ]ירדן צוקרמן, מנהל אבטחת תוכנה, Nvidia
יום שני, 18.03.2024, 18:00
הצטרפו אלינו להרצאה ופיצה!
אתגרי אבטחת סייבר בעידן המודרני
מאת ירדן צוקרמן, מנהל אבטחת תוכנה, Nvidia
יום שני | 18 במרץ, 2024 | 18:00 | אודיטוריום הפסנתר בניין טאוב
הרשמה ...
[ לנוסח המלא ]
יום שני, 18.03.2024, 13:30
זיסאפל (הנדסת חשמל ומחשבים) חדר 608
I'll present our paper about the role that null messages play in synchronous systems with and without failures. Our work provides necessary and sufficient conditions on the structure of protocols for information transfer and coordination there. We start by introducing a new and more refined definition of null messages. A generalization of message chains that allow these null messages is provided and is shown to be necessary and sufficient for information transfer in reliable systems. Coping with...
[ לנוסח המלא ]
יום רביעי, 13.03.2024, 12:15
Differential Privacy (DP) is a mathematical framewirk for ensuring the privacy of individuals in a dataset. Roughly speaking, it guarantees that privacy is protected in data analysis by ensuring that the output of an analysis does not reveal sensitive information about any specific individual, regardless of whether their data is included in the dataset or not.This talk presents a unified framework for characterizing both pure and approximate differentially private learnabiliity under the...
[ לנוסח המלא ]
יום רביעי, 13.03.2024, 10:30
To deploy and operate deep neural models in production, the quality of their predictions, which might be contaminated benignly or manipulated maliciously by input distributional deviations, must be monitored and assessed. Specifically, we study the case of monitoring the healthy operation of a deep neural network (DNN) receiving a stream of data, with the aim of detecting input distributional deviations over which the quality of the network’s predictions is potentially damaged. Using selective...
[ לנוסח המלא ]
יום שלישי, 12.03.2024, 14:30
Multi-rotor aerial autonomous vehicles (MAVs) primarily rely on vision for navigation purposes. However, visual localization and odometry techniques suffer from poor performance in low or direct sunlight, a limited field of view, and vulnerability to occlusions. Acoustic sensing can serve as a complementary or even alternative modality for vision in many situations, and it also has the added benefits of lower system cost and energy footprint, which is especially important for micro aircraft. Thi...
[ לנוסח המלא ]אור אביטן (סמינר לתואר שני)
יום שלישי, 12.03.2024, 11:30
חדר 1061, בניין מאייר, הפקולטה להנדסת חשמל
We propose that spaceborne polarimetric imagers can be calibrated, or self-calibrated using zodiacal light (ZL). ZL is created by a cloud of interplanetary dust particles. It has a significant degree of polarization in a wide field of view. From space, ZL is unaffected by terrestrial disturbances. ZL is insensitive to the camera location, so it is suited for simultaneous cross-calibration of satellite constellations. ZL changes on a scale of months, thus being a quasi-constant target in realisti...
[ לנוסח המלא ]
יום שני, 11.03.2024, 13:30
זיסאפל (הנדסת חשמל ומחשבים) חדר 608
I will share some of my learnings from working on problems on the intersection of Distributed Computing and Cryptography.On the one hand, I will show how some cryptographic protocols (MPC and DKG) can be improved by using distributed computing counterparts for notions such as zero knowledge proofs and proofs of knowledge. On the other hand, I will show how distributed computing protocols (ABA) can be improved by carefully using notions of binding from cryptography. One recurring theme is...
[ לנוסח המלא ]
יום שני, 11.03.2024, 10:30
Most works on modeling the conversation history in Conversational Question Answering (CQA) report a single main result on a common CQA benchmark. While existing models show impressive results on CQA leaderboards, it remains unclear whether they are robust to shifts in setting (sometimes to more realistic ones), training data size (e.g. from large to small sets) and domain. In this work, we design and conduct the first large-scale robustness study of history modeling approaches for CQA. We find t...
[ לנוסח המלא ]
יום ראשון, 10.03.2024, 18:00
אנבידיה מזמינה אתכם ליום זרקור וירטואלי בו מהנדסי ומהנדסות החברה יספרו על הקבוצות השונות והמשרות הפתוחות
יום ראשון, 10 במרץ, בין השעות 18:00-19:30
להרשמה לאירוע כאן
...
[ לנוסח המלא ]
יום רביעי, 06.03.2024, 12:30
קומת הכניסה, בניין טאוב למדעי המחשב
חברת Cadence מגיעה ליום זרקור בפקולטה
יום ד' 6/3 | 12:30-14:30 | לובי טאוב
בתוכנית: מפגש עם צוותי הגיוס, המהנדסים והמהנדסות לשיחה 1:1 על הזדמנויות תעסוקה וטיפים לכתיבת קו"ח.
וכמובן מרצ' ומתוקים.
מחכים לכם!! ...
[ לנוסח המלא ]יאיר כרמון (אוניברסיטת תל אביב)
יום רביעי, 06.03.2024, 12:15
We design a new stochastic first-order algorithm for approximately solving matrix games as well as the more general problem of minimizing the maximum of smooth convex functions. Our central tool is ball oracle acceleration: a technique for minimizing any convex function with a small number of calls to a ball oracle that minimizes the same function restricted to a small ball around the query point. To design an efficient ball oracle for our problems of interest we leverage stochastic gradient des...
[ לנוסח המלא ]
יום שלישי, 05.03.2024, 15:00
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...
[ לנוסח המלא ]מור פילו, בוגרת הפקולטה ומפתחת באמזון
יום שני, 04.03.2024, 18:30
התקבלת למשרת סטודנט! מה עכשיו?
קהילת הסטודנטיות בפקולטה SHE S מזמינה אותך למפגש בנושא:
משרת סטודנט ראשונה: על ההזדמנויות, האתגרים והמיומנויות שרוכשים בעבודה הראשונה
יום שני, 4/3 בשעה 18:30 באודיטוריום פסנתר
נא הירשמי מראש: כאן
ד...
[ לנוסח המלא ]
יום חמישי, 29.02.2024, 15:00
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...
[ לנוסח המלא ]
יום רביעי, 28.02.2024, 12:30
קומת הכניסה, בניין טאוב למדעי המחשב
יום זרקור לחברת אנבידיה בטכניון ב-28.2.24
אנבידיה מגיעה לפגוש את הסטודנטים והסטודנטיות של הפקולטה למדעי המחשב בטכניון!
בואו לפגוש את מהנדסי ומהנדסות החברה פנים מול פנים
יום רביעי 28.2.24 | 12:30-14:30 | לובי טאוב, קומה 0...
[ לנוסח המלא ]שראל כהן (המכללה האקדמית תל-אביב)
יום רביעי, 28.02.2024, 12:15
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...
[ לנוסח המלא ]
יום שני, 26.02.2024, 13:30
זיסאפל (הנדסת חשמל ומחשבים) חדר 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 ...
[ לנוסח המלא ]
יום חמישי, 22.02.2024, 15:00
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...
[ לנוסח המלא ]
יום רביעי, 21.02.2024, 17:00
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...
[ לנוסח המלא ]
יום רביעי, 21.02.2024, 15:00
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...
[ לנוסח המלא ]
יום רביעי, 21.02.2024, 12:15
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 (...
[ לנוסח המלא ]
יום שני, 19.02.2024, 13:30
זיסאפל (הנדסת חשמל ומחשבים) חדר 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...
[ לנוסח המלא ]
יום חמישי, 15.02.2024, 11:00
הרצאת זום:
קישור וטאוב 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...
[ לנוסח המלא ]
יום רביעי, 14.02.2024, 12:15
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...
[ לנוסח המלא ]
יום רביעי, 14.02.2024, 11:30
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...
[ לנוסח המלא ]
יום שלישי, 13.02.2024, 18:30
בואו להיות חלק מקבוצת Capture The Flag-CTF חדשה בפקולטה
המפגשים מתקיימים מדי יום ג' בשעה 18:30 בטאוב 9 וכוללים הרצאות אורח והתנסות מעשית בפתרון אתגרים.
כולם מוזמנים! מתחילים ובעלי ניסיון
לפרטים: Technionctf.com
השבוע 13.2.24:
18:30 | טאוב 2 | עומר אטיאס - ...
[ לנוסח המלא ]
יום שני, 12.02.2024, 12:00
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...
[ לנוסח המלא ]
יום רביעי, 07.02.2024, 12:30
מוזמנים ליום זרקור של חברת פיינל
יום רביעי 07.02.2024 | 12:30-14:30 | אודיטוריום מרכז המבקרים 012, קומה 0
12:30 - בואו לפגוש מהנדסים, חוקרים ואת צוות הגיוס בפיינל, ולהכיר את היום יום בפיינל.
13:15 - מפגש על אופציות, הסתברויות ועולם האלגוטריידינג | נועם הורוביץ - חו...
[ לנוסח המלא ]
יום רביעי, 07.02.2024, 12:15
בואו להיות חלק מקבוצת Capture The Flag-CTF חדשה בפקולטה
המפגשים מתקיימים מדי יום ג' בשעה 18:30 בטאוב 9 וכוללים הרצאות אורח והתנסות מעשית בפתרון אתגרים.
כולם מוזמנים! מתחילים ובעלי ניסיון
לפרטים: Technionctf.com
השבוע 6.2.24:
מתחילים: פורנזיקה & רש...
[ לנוסח המלא ]
יום שלישי, 06.02.2024, 18:30
בואו להיות חלק מקבוצת Capture The Flag-CTF חדשה בפקולטה
המפגשים מתקיימים מדי יום ג' בשעה 18:30 בטאוב 9 וכוללים הרצאות אורח והתנסות מעשית בפתרון אתגרים.
כולם מוזמנים! מתחילים ובעלי ניסיון
לפרטים: Technionctf.com
השבוע 6.2.24:
מתחילים: פורנזיקה & רשת...
[ לנוסח המלא ]
יום שלישי, 06.02.2024, 12:30
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 ...
[ לנוסח המלא ]גיא גזיב (מעבדת דיקרלו ב-MIT)
יום שלישי, 06.02.2024, 11:30
חדר 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...
[ לנוסח המלא ]גלעד אשרוב (אוניברסיטת בר אילן)
יום חמישי, 01.02.2024, 11:30
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 ...
[ לנוסח המלא ]
יום רביעי, 31.01.2024, 12:30
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...
[ לנוסח המלא ]
יום רביעי, 31.01.2024, 12:15
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...
[ לנוסח המלא ]ד"ר יניב דוד (אוניברסיטת קולומביה)
יום רביעי, 31.01.2024, 11:30
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...
[ לנוסח המלא ]
יום רביעי, 31.01.2024, 10:30
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...
[ לנוסח המלא ]
יום שני, 29.01.2024, 15:30
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...
[ לנוסח המלא ]
יום ראשון, 28.01.2024, 10:30
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...
[ לנוסח המלא ]
יום רביעי, 24.01.2024, 12:15
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...
[ לנוסח המלא ]
יום שלישי, 23.01.2024, 18:30
קבוצת Technion CTF Team נפתחת בפקולטה
אנו מזמינים אתכם להצטרף למפגשי Capture The Flag - CTF .CTF היא תחרות אתגרי סייבר ואבטחת מידע בנושאים: קריפטוגרפיה, הנדסה לאחור, פורנזיקה, ווב וכיוצ"ב.
המפגשים יכללו הרצאות אורח והתנסות מעשית בפתרון אתגרים. מוזמנים להצטרף סטודנטים מתחילים וסטוד...
[ לנוסח המלא ]פרופ' מישה קז'דן (מדעי המחשב, אוניברסיטת ג'ונס הופקינס)
יום חמישי, 18.01.2024, 11:30
טאוב 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...
[ לנוסח המלא ]
יום רביעי, 17.01.2024, 12:15
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...
[ לנוסח המלא ]
יום שלישי, 16.01.2024, 11:00
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...
[ לנוסח המלא ]
יום חמישי, 04.01.2024, 12:30
הפקולטה להנדסה ביו-רפואית, בניין סילבר, חדר 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...
[ לנוסח המלא ]
יום שני, 01.01.2024, 10:30
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...
[ לנוסח המלא ]