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

We study the 2-Dimensional Vector Bin Packing Problem (2VBP), a generalization of classic Bin Packing that is widely applicable in resource allocation and scheduling. In 2BVP we are given a set of items, where each item is associated with a two-dimensional volume vector. The objective is to partition the items into a minimal number of subsets (bins), such that the total volume of items in each subset is at most 1 in each dimension. We ...
[לנוסח המלא]

Deep Point Correspondence presents a new method for real-time non-rigid dense correspondence between point clouds based on structured shape construction. The method requires a fraction of the training data compared to previous techniques and presents better generalization capabilities. Until now, two main approaches have been suggested for the dense correspondence problem. The first is a spectral-based approach that obtains great results on synthetic datasets but requires mesh connectivity of the shapes and long inference processing ...
[לנוסח המלא]

The current gold standard in solving image processing and computer vision tasks is using supervised learning of deep neural networks (DNNs), requiring large-scale datasets of input-output pairs. In many scenarios in which the output is an image -- e.g., medical image analysis, image denoising, deblurring, super-resolution, dehazing, segmentation and optical flow estimation -- the collection of labeled image pairs for training is either time-consuming or limited to simple degradation models. Indeed, there is an increasing ...
[לנוסח המלא]

ועד הסטודנטים במדעי המחשב מזמין אתכם לערב הכנה ייחודי שיועבר על-ידי 4 מהנדסים מנוסים מהתעשייה ומייסדי המיזם "חברמי" - מיזם חברתי ללא מטרות רווח, שנועד לעזור לסטודנטים ולבוגרים במדעי המחשב להשתלב בתעשיית ההייטק: סלביק נימר- Principal Engineer במיקרוסופט גל דרוקר- בוגר הפקולטה ו- Tech Lead באמאזון אלדר סחייק - Software Engineer and Career Start Mentor ערן ליפשטיין - Full Stack Developer המפגש יתקיים ביום ראשון, 26 בדצמבר, 19:00 בטאוב 337 ויכלול: רצף הרצאות קצרות ופאנל ...
[לנוסח המלא]

Due to the end of Moore’s law, hardware has been developing more rapidly in recent years than it has at any point since the early days of computing. These hardware developments are trending toward multiprocessor settings, which have the potential to deliver the speedups that CPU frequency scaling can no longer support. In this talk, I will discuss my work on building theoretical foundations for emerging multiprocessor technologies. I will focus on one line of ...
[לנוסח המלא]

מפגש מתעניינים בלימודים בטכניון ובפקולטה למדעי המחשב יתקיים באופן מקוון ביום חמישי, 23 בדצמבר, 2021. פרטים והרשמה.
[לנוסח המלא]

A secret-sharing scheme allows to distribute a secret $s$ among $n$ parties such that only some predefined “authorized” sets of parties can reconstruct the secret $s$, and all other “unauthorized” sets learn nothing about $s$. For over 30 years, it was known that any (monotone) collection of authorized sets can be realized by a secret-sharing scheme whose shares are of size $2^{n-o(n)}$ and until recently no better scheme was known. In a recent breakthrough, Liu ...
[לנוסח המלא]

The referring video object segmentation task (RVOS) involves segmentation of a text-referred object instance in the frames of a given video. Due to the complex nature of this multimodal task, which combines text reasoning, video understanding, instance segmentation and tracking, existing approaches typically rely on sophisticated pipelines in order to tackle it. In this work, we propose a simple Transformer-based approach to RVOS. Our framework, termed Multimodal Tracking Transformer (MTTR), models the RVOS task as ...
[לנוסח המלא]

Many important networking systems were designed decades ago, with a "closed environment" as a fundamental invariant: the networking infrastructure in a moving car, a flying aircraft, or a fenced power plant, were implicitly assumed to be isolated. As a result, the communication bus protocols were designed to function well despite natural phenomena such as noise, interference, radiation and so forth. No defenses against malicious adversaries were designed in. Once these isolated systems are connected to ...
[לנוסח המלא]

Due to the end of Moore’s law, hardware has been developing more rapidly in recent years than it has at any point since the early days of computing. These hardware developments are trending toward multiprocessor settings, which have the potential to deliver the speedups that CPU frequency scaling can no longer support. In this talk, I will discuss my work on building theoretical foundations for emerging multiprocessor technologies. I will focus on one line of ...
[לנוסח המלא]

With millions of scientific papers coming out every year, researchers are forced to allocate their attention to increasingly narrow areas. This creates isolated “research bubbles” that limit knowledge discovery and slow down scientific progress. Toward addressing this large-scale challenge for the future of science, my work explores new paradigms for helping scientists search and discover scholarly knowledge by developing novel approaches in information retrieval and AI/ML settings and models. In this talk, I will present ...
[לנוסח המלא]

We wish to identify the queries that can be solved with close to optimal time guarantees over relational databases. Computing all query answers requires at least linear time before the first answer (to read the input and determine the answer's existence), and then we must allow enough time to print all answers (which may be many). Thus, we aspire to achieve linear preprocessing time and constant or logarithmic time per answer. A known dichotomy classifies ...
[לנוסח המלא]

Traditional computational models consider a one-shot computation, run on a single machine, with full knowledge of the input. In contrast, in many modern applications, the input is evolving, or is too large to be stored on any one machine, and is therefore partially unknown. These aspects of modern computation require decision-making under uncertainty. For example, in ride hailing applications, where drivers and riders arrive over time, the app needs to match users to each other ...
[לנוסח המלא]

Autonomous scene exposure and exploration in localization- and communication-denied areas -- useful for finding targets in unknown scenes, mainly when direct maneuvering of the vehicle is impossible -- remains a challenging problem in computer navigation. In this work we propose a novel deep learning-based navigation approach that is able to solve this problem and demonstrate its ability in an even more complicated setup, i.e., when computational power is limited. Our method works directly with the ...
[לנוסח המלא]

The field of quantum information is becoming more known to the general public. However, effectively demonstrating the concepts underneath quantum science and technology to the general public can be a challenging job. In this work, we present ``Quantum Candies'' (Qandies), a model for intuitively describing basic concepts in quantum information without the need for complex algebra or the concept of superpositions. We discuss several properties of Qandies, including their relation to quantum theory (Qubits), quantum ...
[לנוסח המלא]

יום המחקר העשירי לתארים מתקדמים בפקולטה למדעי המחשב יתקיים ביום רביעי, 15 בדצמבר, 2021, בין השעות 12:30-14:30, בלובי של בניין טאוב למדעי המחשב. יום מחקר הוא הזדמנות עבור משתלמי הפקולטה להציג את מחקריהם באמצעות פוסטרים ומצגות בפני אנשי סגל ומנהלים בכירים בטכניון ותלמידים לכל התארים בפקולטה, כמו גם בפני נציגים רמי-דרג מחברות מובילות בתעשייה העילית בארץ ובעולם. המחקרים המשתתפים ביום המחקר יהיו בנושאים שונים: Cryptology and Cyber, Data Centers and Clouds, Graphics, Intelligent Systems and ...
[לנוסח המלא]

Recent years have witnessed tremendous progress in the field of Machine Learning (ML). However, many of the recent breakthroughs demonstrate phenomena that lack explanations, and sometimes even contradict conventional wisdom. One main reason for this is because classical ML theory adopts a worst-case perspective which seems too pessimistic to explain practical ML: in reality data is rarely worst-case, and experiments indicate that often much less data is needed than predicted by traditional theory. In this ...
[לנוסח המלא]

יום עיון בסייבר ואבטחת מידע יתקיים ביום שני, 13 בדצמבר, 2021 בטכניון בנושא: Operational Technology (OT) Security. יום העיון מאורגן בידי אלי ביהם, ירון גוטמרק והמרכז המחקר לאבטחת סייבר ע"ש הירושי פוג'יאוורה. OT שולטת בעולם התעשייתי המודרני, ובכלל זה תרופות, תחנות כוח, בתי חולים, אספקת מים, וכמעט כל מערכת השולטת בבניינים או בייצור, בין אם הדבר קריטי או לא, בעקבות Stuxnet והתקפות אחרות, האבטחה של מערכות אלו נחקרת בהרחבה, וטכניקות אבטחה חדשות מוצגות. באירוע זה ...
[לנוסח המלא]

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

Given a distributed network, represented by a graph of computation nodes connected by communication edges, a fundamental problem is computing distances between nodes. Our recent line of works show that while exactly computing all distances (All-Pairs-Shortest-Paths, APSP) in certain distributed settings currently has O(n^{1/3}) complexity, it is possible to find very good distance approximations even with an O(1) complexity. This talk will present a unified view of our various papers developing these interesting advances in ...
[לנוסח המלא]

IPv4 headers include a 16-bit ID field. Our work examines the generation of this field in Windows, Linux and Android, and shows that the IP ID field enables remote servers to assign a unique ID to each device and thus be able to identify subsequent transmissions sent from that device. This identification works across all browsers and over network changes, including VPNs and browser privacy modes. In modern Linux and Android versions, this field leaks ...
[לנוסח המלא]

The current gold standard in solving image processing and computer vision tasks is using supervised learning of deep neural networks (DNNs), requiring large-scale datasets of input-output pairs. In many scenarios in which the output is an image -- e.g., medical image analysis, image denoising, deblurring, super-resolution, dehazing, segmentation and optical flow estimation -- the collection of labeled image pairs for training is either time-consuming or limited to simple degradation models. Indeed, there is an increasing ...
[לנוסח המלא]

Whether one-way functions (OWFs) exist is the most important outstanding problem in Cryptography. We will survey a recent thread of work (Liu-Pass, FOCS'20, Liu-Pass, STOC'21, Liu-Pass, Crypto'21) showing the equivalence of the existence of OWFs and (mild) average-case hardness of various problems related to time-bounded Kolmogorov complexity that date back to the 1960s. These results yield the first natural, and well-studied, computational problems characterizing the feasibility of the central private-key primitives and protocols in Cryptography. ...
[לנוסח המלא]

We show extremely efficient distributed algorithms for sparse matrix multiplication, distance computations (e.g. All-Pairs-Shortest-Paths, APSP), and subgraph existence problems. Our work identifies core observations regarding distributed computation and uses these to simultaneously tackle a variety of problems in several theoretical, distributed models. The central theme uniting our developments is designing sparsity-aware load balancing techniques and then applying them to problems on general, non-sparse, graphs.
[לנוסח המלא]

In recent years, the need to accommodate non-Euclidean structures in data science has brought a boom in deep learning methods on graphs, leading to many practical applications with commercial impact. In this talk we will review the mathematical foundations of the generalization capabilities of graph convolutional neuralnetworks (GNNs). We will focus mainly on spectral GNNs, where convolution is defined as element-wise multiplication in the frequency domain of the graph. In machine learningsettings where the dataset ...
[לנוסח המלא]

הנכם מוזמנים לסדנת שדרוג קורות חיים שתתקיים בשיחת אחד על אחד עם מגייס מחברת הייטק מובילה אשר תעזור לכם לשפר את "כרטיס הביקור" שלכם לעולם התעסוקה ולראיונות עבודה בפרטים כגון: - כיצד להיות יוצא דופן - כיצד להתמודד עם חוסר ניסיון או עם ממצוע לא גבוה - שימוש במילות מפתח ("באז") במנועי חיפש ועוד. לאחר הרשמה (עד 30 בנובמבר 2021) וצירוף קורות החיים שלכם, יישלח אליכם אימייל מאת מגייסת/ת לקביעת שיחה מרחוק באורך כ-15 דקות ...
[לנוסח המלא]

הפקולטה למדעי המחשב מזמינה אתכם לסדנה בתחום חשיפה למשרות בתעשייה בנושאי Web Development אשר תדון בשמעות מילות מפתח (Buzz Words) וכותרות למיניהן כמו גם בטכנולוגיות ובמוצרים שהיא מפתחת, תאפשר הצצה ליום עבודה טיפוסי, אפשרויות פיתוח קריירה ואופק מקצועי, וכן תינתן הרצאה מפי דוד ינאי, בוגר תואר שני בפקולטה ו-CTO בחברת Pikoya. הסדנה תתקיים ביום רביעי, 24 בנובמבר, 2021, 18:30 וקישור למפגש זום יישלח לנרשמים מראש. כולם מוזמנים.
[לנוסח המלא]

נציגי חברת Mobileye , יגיעו לפקולטה להציג את תהליכי הגיוס והמשרות הפנויות ביום רביעי 24 בנובמבר 2021, 12:30, בקומת הכניסה של בניין טאוב, והרצאה בנושא: Accelerating Autonomous Driving מפי אריה טל, Principal Engineer Manager תתקיים בשעה 13:30 בכיתה 3 בקומת הכניסה - - נא להירשם מראש להרצאה. כולם מוזמנים.
[לנוסח המלא]

הנכם מוזמנים למפגש היכרות עם חוקרים בקבוצת התיאוריה בפקולטה אשר ידברו על מבניות ברשתות מבוזרות, חישובים על מידע סודי, נכונות חישובים, הכרעת הרוב במשפט ותדרים לתחנות רדיו. האירוע יתקיים ביום רביעי, 24 בנובמבר, 2021 בשעה 12:15, במרפסת טאוב (קומה 2). כולם מוזמנים!
[לנוסח המלא]

The Network Time Protocol (NTP) synchronizes time across computer systems over the Internet, and so constitutes a crucial part of the Internet infrastructure. Unfortunately, NTP is highly vulnerable to “time shifting attacks”, which has severe implications for time-sensitive applications, as well as many security mechanisms. I will discuss our recent proposals for securing NTP, which draw ideas from distributed computing theory to achieve good synchronization even in the presence of powerful man-in-the-middle attackers. I will ...
[לנוסח המלא]

Understating and controlling generative models' latent space is a complex task. In this work, we propose a novel method to learn the behavior of any specific attribute in an existing GAN's latent space and edit real data samples accordingly. We perform Sim2Real learning, relying on only three synthetic samples from two classes per attribute, allowing an unlimited amount of different precise edits. We present an AutoEncoder based model which learns both the essence of a ...
[לנוסח המלא]