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

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

In this talk, I will present a journey that started three years ago at the intersection between light leakage and information confidentiality. In the first part of the talk, I will present the topic of electro-optical speech eavesdropping which is based on three methods we developed to recover speech from light emitted from light bulbs (Lamphone USENIX Security 22), power LEDs of speakers (Glowworm Attack CCS 21), and from light reflected from shiny ornaments and ...
[לנוסח המלא]

For decades now cryptographic tools and models have at their essence transformed technology platforms controlled by worst case adversaries to trustworthy platforms. In this talk I will describe how to use cryptographic tools and cryptographic modeling to build trust in various phases of the machine learning pipelines. We will touch on privacy in the training and inference stage, verification protocols for the quality of machine learning models, and robustness in presence of adversaries. If time ...
[לנוסח המלא]

Reinforcement Learning (RL) is a field concerned with designing general purpose learning algorithms that solve sequential-decision tasks. In recent years, by using deep neural networks, RL algorithms were applied on high-dimensional and challenging domains, witnessing unprecedented success. Yet, despite recent advancements, the theoretical foundations of high-dimensional RL are not fully understood. A recurring theme in high-dimensional RL is the presence of irrelevant information in the observations. E.g., in a visual navigation task the observation might ...
[לנוסח המלא]

The first half of the talk will overview Delsarte's association scheme-theoretic approach to coding theory, which has been used extensively over the past few decades to obtain bounds on many different classes of codes. For example, the Hamming scheme and the Johnson scheme both have classical roles in the theory of linear codes and constant-weight codes respectively, whereas the permutation scheme has been used recently in the study of permutation codes, a less well-known class ...
[לנוסח המלא]

Random walks on expanders are extremely useful in TOC. Unfortunately though, they have an inherent cost. E.g., the spectral expansion of a Ramanujan graph deteriorates exponentially with the length of the walk (when compared to a Ramanujan graph of the same degree). In this talk, we will see how this exponential cost can be reduced to linear by applying a permutation after each random step. These permutations are tailor-made to the graph at hand, requiring ...
[לנוסח המלא]

Computational imaging systems are based on the joint design of optics and associated image reconstruction algorithms. Historically, many such systems have employed simple transform-based reconstruction methods. Modern optimization methods and priors can drastically improve the reconstruction quality in computational imaging systems. Furthermore, learning-based methods can be used to design the optics along with the reconstruction method, yielding truly end-to-end optimized imaging systems that outperform classical solutions. Bio: Wolfgang Heidrich is a Professor of Computer Science ...
[לנוסח המלא]

Guruswami and Smith (J. ACM 2016) considered codes for channels that are computationally bounded and flip at most a p-fraction of the bits of the codeword. This class of channels is significantly stronger than Shannon’s binary symmetric channel (which flips each bit independently with probability p) but weaker than Hamming’s channels (which may flip at most a p-fraction of the bits, and are computationally unbounded). The goal of this area is to construct codes against ...
[לנוסח המלא]

We study the fine-grained complexity of conjunctive queries with grouping and aggregation. For some common aggregate functions (e.g., min, max, sum), such a query can be phrased as an ordinary conjunctive query over a database annotated with a suitable commutative semiring. Specifically, we study the ability to evaluate such queries by constructing in log-linear time a data structure that provides logarithmic-time direct access to the answers ordered by a given lexicographic order. This task is ...
[לנוסח המלא]

It is standard practice in deep learning to train large models on relatively small datasets. This can potentially lead to severe overfitting, but more often than not, test error is actually good. This phenomenon has prompted research on the so-called "Implicit Bias of Deep Learning Algorithms". Here I will discuss our recent works on multiple novel facets of this bias, and present theoretical and empirical results in different settings. In particular, I will discuss analysis ...
[לנוסח המלא]

Assessing microsatellite stability status of a patient's colorectal cancer is crucial in personalizing treatment regime. Recently, convolutional-neural-networks (CNN) combined with transfer-learning approaches were proposed to circumvent traditional laboratory testing for determining microsatellite status from hematoxylin and eosin stained biopsy whole slide images (WSI). However, the high resolution of WSI practically prevent direct classification of the entire WSI. Current approaches bypass the WSI high resolution by first classifying small patches extracted from the WSI, and then ...
[לנוסח המלא]

Network verification, applying formal methods to verify properties of router configurations, is already mainstream with startups like Forward and Veriflow Networks, and divisions in established companies such as Amazon’s ARG and Cisco’s Candid. In this talk, I will survey what remains to be done including: extending formal methods to implementations, and to other parts of the network ecosystem besides routing. I will illustrate these points with recent work we have done on improving the robustness ...
[לנוסח המלא]

The task of constructing codes against adversarial insertions and deletions (insdel) has recently received much attention. In this work, we study the performance of Reed-Solomon codes against insdel errors. We prove that there are Reed-Solomon codes that achieve the half-Singleton bound. In other words, there are optimal Reed-Solomon codes also against insdel errors. We also give a set of evaluation points that define a Reed-Solomon code that achieves this bound. As the field size that ...
[לנוסח המלא]

הנכם מוזמנים לסדנה בה יציג ראביב גורטנשטיין (Director of People Brand & Experience ב-Riskified) כלים מעשיים לבניית מותג אישי וכיצד הוא יכול לסייע בבניית הקריירה, הרחבת רשת הקשרים, מציאת הזדמנויות ומיצוב המומחיות בתחום האישי. הסדנה תתקיים ביום רביעי, 7 בדצמבר, 2022, 18:30, בטאוב 337. נא להירשם מראש
[לנוסח המלא]

Motivated by machine learning applications, much research over the last decade was devoted to solving submodular maximization problems under Big Data computational models. Perhaps the most basic such problem is the problem of maximizing a submodular function subject to a cardinality constraint. A recent series of papers has studied this problem in the data stream model, and in particular, fully determined the approximation ratio that can be obtained for it by (semi-)-streaming algorithms both when ...
[לנוסח המלא]

מהנדסים וצוותי גיוס של חברת ביוסנס וובסטר יגיעו לפקולטה להציע אפשרויות תעסוקה ומשרות פתוחות, ולהרצות על החיבור בין רפואה ומדעי המחשב. יום רביעי, 7 בדצמבר 2022, בלובי ובכיתה 3 בבניין טאוב למדעי המחשב: 12:30 בלובי טאוב - מפגש עם מהנדסים וצוותי הגיוס בלובי טאוב 13:30 בטאוב 3 - הרצאה: Geometrical Challenges in Treating Arrythmia מפי ד"ר פאדי מצארווה, בוגר הפקולטה ומהנדס תוכנה בתחום התלת-ממד בביוסנס וובסטר. נא להירשם מראש.
[לנוסח המלא]

Stream monitoring is fundamental in many data stream applications, such as financial data trackers, security, anomaly detection, and load balancing. To cope with high-speed data streams, these applications require algorithms that are both time and space efficient to cope with high-speed data streams. Space efficiency is needed due to the memory hierarchy structure, to enable cache residency and to avoid page swapping. Even if the potential computing cost is low, this residency is critical for ...
[לנוסח המלא]

At a time when Moore’s Law is reaching its end, the volume of data created, curated, and consumed worldwide grows exponentially. As a result, general-purpose processors are struggling to keep up with the throughput demand of big data analytics workloads. In this talk I will present Speedata and the Analytics Processing Unit (APU), the first hardware accelerator for big data analytics. Speedata’s APU accelerates existing software frameworks (e.g., Apache Spark, Apache Presto) and improves performance/cost ...
[לנוסח המלא]

Random walks on expanders are extremely useful in TOC. Unfortunately though, they have an inherent cost. E.g., the spectral expansion of a Ramanujan graph deteriorates exponentially with the length of the walk (when compared to a Ramanujan graph of the same degree). In this talk, we will see how this exponential cost can be reduced to linear by applying a permutation after each random step. These permutations are tailor-made to the graph at hand, requiring ...
[לנוסח המלא]

New families of reconstruction codes motivated by DNA data storage and sequencing applications will be discussed. In such applications, DNA strands are sequenced by reading some subset of their substrings. The discussion will start with the extreme case of the torn-paper channel in which substrings are read with no overlap. Our model extends the previously researched probabilistic setting to the worst-case. We will construct asymptotically optimal codes, with efficient encoding and decoding algorithms, for any ...
[לנוסח המלא]

הנכם מוזמנים לערב "מחקר על הבר" - הרצאות TED ומפגש עם שלושה חברי סגל ומלגאים בקבוצות המחקר ביום רביעי, 23 בנובמבר בשעה 18:30 בטאוב 337: ד"ר שרה קרן: האם זה משתלם לרובוט שלי להיות נחמד? ד"ר יניב רומנו: פוליגרף למערכות לומדות: גם מכונות טועות לפעמים ד"ר ניר רוזנפלד: מערכות לומדות בסביבה אנושית, או: מי צריך נדנדה לטלפון? נא להירשם מראש. תמונות מהאירוע
[לנוסח המלא]

שלום לסטודנטים מצטיינים לתואר ראשון בפקולטה למדעי המחשב! הפקולטה למדעי המחשב מזמינה סטודנטים מצטיינים הלומדים לתואר ראשון בפקולטה להמשיך במסורת המצויינות ולהשתתף במפגש בנושא לימוד לתארים מתקדמים בפקולטה. במפגש יוצגו שלל האפשרויות וההזדמנויות המוצעות למשתלמים לתארים מתקדמים, והוא יתקיים ביום רביעי, 23 בנובמבר 2022, בין השעות 12:30-14:00 בחדר 337, קומה 3, בניין טאוב למדעי המחשב. מ"מ דיקן הפקולטה וסגן הדיקן ללימודי תארים מתקדמים ישתתפו במפגש וישמחו לענות על שאלותיכם. בתוכנית: 12:30-12:45 - קבלת פנים 12:45-12:50 ...
[לנוסח המלא]

The All-Pairs Max-Flow problem (APMF) asks to compute the maximum flow (or equivalently, the minimum cut) between all pairs of nodes in a graph. The naive solution of making n^2 calls to a (single-pair) max-flow algorithm was beaten in 1961 by a remarkable algorithm of Gomory and Hu that only makes n-1 calls. Within the same time bound, their algorithm also produces a cut-equivalent tree (a.k.a. GH-Tree) that preserves all pairwise minimum cuts exactly. This ...
[לנוסח המלא]

This work investigates the transfer of information in fault-prone synchronous systems using null messages. The notion of an {\em $f$-resilient message block} is defined to capture the fundamental communication pattern for knowledge transfer. This pattern may involve null messages in addition to explicit messages, and hence, it provides a fault-tolerant extension of the classic notion of a message-chain. Based on the above, we provide tight necessary and sufficient characterizations of the generalized communication patterns, including ...
[לנוסח המלא]

We present dynamic algorithms with polylogarithmic update time for estimating the size of the maximum matching of a graph undergoing edge insertions and deletions with approximation ratio strictly better than 2. This answers in the affirmative the value version of a major open question, repeatedly asked in the dynamic graph algorithms literature. Based on an upcoming SODA 2023 best paper, joint with Sayan Bhattacharya, Peter Kiss and Thatchaphol Saranurak.
[לנוסח המלא]

הנכם מוזמנים להרצאה: Building the Monstera Games Platform מפי דוד ינאי, CTO בחברת Pikoya ובוגר תואר שני בפקולטה, על  עולם ותעשיית המשחקים המשמש מילארדי משתמשים ברחבי העולם, ועל היבטי המימוש, הארכיטקטורה והאתגרים הרבים איתם התמודדה פיקויא בבניית הפלטפורמה. ההרצאה תתקיים ביום שני, 21 בנובמבר 2022, בשעה 18:30 בטאוב 337. נא להירשם מראש.
[לנוסח המלא]

A high order accurate deep learning method for computing geodesic distances on surfaces is introduced. We consider two main components for computing distances on surfaces; A numerical solver that locally approximates the distance function and an efficient causal ordering scheme by which surface points are updated. The proposed method exploits a dynamic programming principle which lends itself to a scheme with quasi-linear computational complexity. The quality of the distance approximation is determined by the local ...
[לנוסח המלא]

Isosurfaces are surface meshes representing ”object” boundaries in scalar field data, such as MRI or CT data. More precisely, isosurfaces are surface meshes representing level sets {f−1(σ) : σ ∈ R}, constructed from a sampling of a function f : R → R3. Isosurface construction, particularly the classical Marching Cubes algorithm (1988), is a standard tool in scientific visualization and geometric modeling, We will discuss Marching Cubes and an alternative, Dual Contouring, isosurface construction in ...
[לנוסח המלא]

Epithelial tissues formed of layered cell surfaces are prevalent in multiple tissues and play an essential role in key biological processes such as development, organ homeostasis and cancer. In this work we study the mechanical aspects of layered multi-cell systems using pseudo-thermodynamic models. First, by use of stochastic simulations we were able to characterize the proliferation properties of a new type of stem cell in the mouse interfollicular epidermis. Further, we used both deterministic and ...
[לנוסח המלא]

In this talk we will discuss dimension-free relations between basic communication and query complexity measures and various matrix norms. Dimension-free relations are inequalities that bound a parameter as a function of another parameter without dependency on the number of input bits. This is in contrast to the more common framework in communication complexity where polylogarithmic dependencies are tolerated. Dimension-free bounds are closely related to structural results, where one seeks to describe the structure of Boolean ...
[לנוסח המלא]

הנכם מוזמנים למפגש שאלות ותשובות על כל מה שמעניין אתכם בתואר שני, עם פאנל סטודנטים לתארים מתקדמים מהפקולטה, שגם יתנו לכם טיפים וישתפו אתכם בניסיון, בחוויות ובאתגרים שלהם, בהשתתפות תלמידי תואר שלישי בפקולטה: רנא שחות, הדס אורגד, עדן סייג ועומר צברי, ביום שני, 14 בנובמבר 2022, בשעה 17:30 במועדון המשתלמים (בסוף המסדרון בקומה 2). המפגש מיועד לסטודנטים בתואר שני וסטודנטים לקראת סיום תואר ראשון המתעניינים בהמשך לימודים לתואר שני . נא להירשם מראש
[לנוסח המלא]

Finding correspondences between shapes is a central task in geometry processing with many applications such as texture or deformation transfer and shape interpolation. We focus on developing a method to find correspondences between non-isometric geometric shapes. Our method follows the functional map approach. However, unlike existing classical functional map approaches our method is able to match extrinsic surface features by design. To achieve this we consider eigenfunctions of the Hessian of an elastic thin shell ...
[לנוסח המלא]

The classic algorithm AdaBoost allows to convert a weak learner, that is an algorithm that produces a hypothesis which is slightly better than chance, into a strong learner, achieving arbitrarily high accuracy when given enough training data. We present a new algorithm that constructs a strong learner from a weak learner but uses less training data than AdaBoost and all other weak to strong learners to achieve the same generalization bounds. A sample complexity lower ...
[לנוסח המלא]

הנכם מוזמנים ליום זרקור מטעם חברת DELL Technologies, לפגוש מהנדסים וצוותי גיוס שיציגו את תוכניות הבוגרים והסטודנטים, הזדמנויות התעסוקה והמשרות הפתוחות, ביום רביעי 9 בנובמבר 2022, בין השעות 12:30-14:30 בלובי טאוב.
[לנוסח המלא]

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

Strategic classification studies learning in settings where agents can modify their features to obtain favourable outcome. Most current works focus on simple decision rules that trigger independent agent responses. Here we examine the implications of learning with more elaborate models that break the independence assumption. We present two works, each studying different (but related) models and tasks, and in which dependencies are introduces through space (using graphs) and time. Our first work considers learning with ...
[לנוסח המלא]

Reliability is an inherent challenge for the emerging nonvolatile technology of racetrack memories, and there exists a fundamental relationship between codes designed for racetrack memories and codes with constrained periodicity. Previous works have sought to construct codes that avoid periodicity in windows, yet have either only provided existence proofs or required high redundancy. This paper provides the first constructions for avoiding periodicity that are both efficient (average-linear time) and with low redundancy (near the lower ...
[לנוסח המלא]

The (extended) Binary Value Principle (eBVP: $k + x_0 + 2x_1 + … + 2^n x_n $ for $k>0$ and $x^2_i=x_i$) has received a lot of attention recently: several lower bounds have been proved for it (Alekseev et al 2020, Alekseev 2021, Part and Tzameret 2021), and a polynomial simulation of a strong semialgebraic proof system in IPS+eBVP has been shown (Alekseev et al 2020). In this talk, we consider Polynomial Calculus with the algebraic ...
[לנוסח המלא]

In this work, we address the problem of learning subclasses of $\mathbb{JUNTA}$ under the {\it exact learning model from membership queries} or {\it black box queries}. First, we address the problem of learning subclasses of decision trees from membership queries. For adaptive non-proper learning of decision trees of depth at most $d$, we give a randomized polynomial time algorithm that asks $\tilde O(2^{2d}) + 2^{d}\log n$ membership queries and a deterministic polynomial time algorithm that ...
[לנוסח המלא]

We will discuss results on the capacity and error probability bounds of the DNA storage channel. First, we consider the case in which the sequencing channel is memoryless and the coverage depth is constant. We will describe lower (achievability) and upper (converse) bounds on the capacity of the channel, as well as a lower (achievability) bound on the reliability function of the channel. Second, we will consider general sequencing channels, and coverage depth scaling, and ...
[לנוסח המלא]

Machine learning made many recent advances in science and technology, specifically in healthcare information technology. Electronic Health Records (EHR) data store the healthcare information. EHR data consists of many features. It is highly complicated, noisy and includes many outliers and missing values. It also contains time-dependent information such as vital sign measurements, diagnosis, treatment, etc. Therefore, basic machine learning models have poor performance on this data, as they do not utilize the time-series aspect of ...
[לנוסח המלא]

Common methods for mitigating spurious correlations in natural language understanding (NLU) usually operate in the output space, encouraging a main model to behave differently from a bias model by down-weighing examples where the bias model is confident. While improving out of distribution (OOD) performance, it was recently observed that the internal representations of the presumably debiased models are actually more, rather than less biased. We propose SimgReg, a new method for debiasing internal model components ...
[לנוסח המלא]

We shall survey and discuss several dimensions in the theory of machine learning.
[לנוסח המלא]

Deep learning has been one of the most common techniques in many industrial and research fields, and that for processing 3D geometries has also been investigated intensely in the last several years. However, compared to the techniques for 3D volumetric images and point sets, those for surface geometries, e.g., represented by triangular meshes, have not been well established due to the difficulty in handling spatial and topological features simultaneously using a neural network. In our ...
[לנוסח המלא]

ReRAM (Resistive Random-Access Memory) crossbar arrays have the potential to provide extremely efficient matrix-vector multiplication (MVM) operations, which are the cornerstone of many DNN (Deep Neural Network) applications. However, there are several challenges in order for ReRAM crossbar arrays (RCAs) to be useful for accelerating large-scale DNN applications. In this talk we discuss two of those challenges. The first one is the distortion in the MVM output of RCAs due to nonidealities such as wire ...
[לנוסח המלא]

Neural sequence models (NSMs) - neural networks adapted specifically for the task of processing input sequences - have emerged as powerful tools in sequence processing, with the current most popular architectures being transformers and RNN variants. But what is a trained network really doing? In this talk we will approach this question, starting from the question of what a network *can* do, and progressing to the question of what a trained network *has* learned in ...
[לנוסח המלא]

Containers, originally designed for cloud environments, are increasingly popular for provisioning workers outside the cloud, for example in mobile and edge computing. These settings, however, bring new challenges: high latency links, limited bandwidth, and resource-constrained workers. The result is longer provisioning times when deploying new workers or updating existing ones, much of it due to network traffic. Our analysis shows that current piecemeal approaches to reducing provisioning time are not always sufficient, and can even ...
[לנוסח המלא]

Lifelong Multi-Agent Pathfinding (L-MAPF) is concerned with planning collision-free paths for a team of agents as they continuously handle tasks involving pick-up and delivery. When modeling autonomous warehouses, typical approaches for L-MAPF consider the environment as populated with static obstacles in the form of inventory pods that the agents must avoid. These obstacles impose narrow passageways, forcing agents to resort to detours and suffer delays on account of bottlenecks. The problem becomes more severe when ...
[לנוסח המלא]

Multi-agent systems are a fascinating, multidisciplinary field with applications to robotics, distributed systems, biology, and social dynamics. A multi-agent system is a distributed system composed of several interacting, autonomous agents that cooperate to achieve some desired behavior. The topic of this talk is the way in which local interactions between extremely simple agents can result in desirable global states. We study this topic from two perspectives: the perspective of an observer of the natural world, ...
[לנוסח המלא]

Learning in organisms is one of their most fundamental but intricate processes. Understanding learning is a longstanding problem in neuroscience as well as in artificial neural networks. In this work, we focus on studying in biological networks during motor learning through the lens of the connectivity of neurons in the primary motor cortex (M1). For this purpose, we analyze the neural activity recorded from awake and behaving mice using two-photon calcium imaging. These imaging methods ...
[לנוסח המלא]

Classic reinforcement learning methods such as Q-learning and policy gradient methods have seen great success in learning to perform a plethora of common tasks in AI, from playing video games to controlling self-driving vehicles and beyond. As a result, these methods and their extensions have become standard in most reinforcement learning settings. However, they have trouble adapting to changes in the environment. We believe this issue can be solved by giving the agent awareness of ...
[לנוסח המלא]

\textit{Interactive Oracle Proofs} (IOPs) are a new type of proof-system that combines key properties of interactive proofs and PCPs: IOPs enable a verifier to be convinced of the correctness of a statement by interacting with an untrusted prover while reading just a few bits of the messages sent by the prover. IOPs have become very prominent in the design of efficient proof-systems in recent years. In this work we study \textit{succinct IOPs}, which are IOPs ...
[לנוסח המלא]

Heilbronn's triangle problem asks how to place n points in the unit square, such that the smallest of the $\binom{n]{ 3}$ triangles is maximized. This problem, which was opened in the 1950s by the mathematician Heilbronn, has not yet been answered for n>8. Calling H)n( the area of the smallest triangle of the best set of n points, no tight bounds on it have been found so far. The best upper and lower bounds are ...
[לנוסח המלא]

One of the main methods for semantic interpretation of text is mapping it into a vector in some embedding space. Such vectors can then be used for a variety of textual processing tasks. Recently, most embedding spaces are a product of training large language models. One major drawback of this type of representation is their incomprehensibility to humans. Understanding the embedding space is crucial for several important needs, including the need to explain the decision ...
[לנוסח המלא]

Clinical multivariate time series (MTS) arising from sensor data, such as EEG and ECG, is used in a variety of tasks. The sensors are composed of multiple leads connected to the body, where each lead generates a time series of data. Combining information from the different leads allows inference of cardiac activity from ECG (arrhythmia, acute coronary syndrome) or brain dysfunction from EEG (brain tumors, strokes, epilepsy). We present a framework for clinical classification of ...
[לנוסח המלא]

Recent global events have emphasized the importance of accelerating the drug discovery process. This process may take more than a decade and its overall cost might exceed one billion dollars. A way to deal with these issues is to use machine learning to increase the rate at which drugs are made available to the public while reducing the cost of the entire process. However, chemical labeled data for real-world applications is extremely scarce making traditional ...
[לנוסח המלא]

We consider the family of Correlation Clustering optimization problems under fairness constraints. In Correlation Clustering we are given a graph whose every edge is labeled either with a $+$ or a $-$, and the goal is to find a clustering that agrees the most with the labels: $+$ edges within clusters and $-$ edges across clusters. The notion of fairness implies that there is no over, or under, representation of vertices in the clustering: every ...
[לנוסח המלא]

In recent years network operators are experiencing changes in clients needs. Self-driving cars, augmented reality games and large scale data streaming are simple examples of new applications that require faster service with higher bandwidth availability to the clients. These changes force the network operators shift their business model and new network paradigms arise. The ongoing transition into 5G networks (and 6G networks that will soon arrive) is enabled in part by the combination of NFV ...
[לנוסח המלא]

Lattice animals are edge-connected sets of cells over various lattices. Some famous examples are polyominoes, polyhexes, polyiamonds and polycubes which are in the square, hexagonal triangular and cubical lattices respectively. Lattice animals have been studied extensively both as a combinatorial object, and as modeling tool in statistical physics. The two most significant problems related to lattice animals are the counting problem and the growth rate problem. The first is simply counting how many lattice animals ...
[לנוסח המלא]

Triangle finding is at the base of many conditional lower bounds in P, mainly for distance computation problems, and the existence of many $4$- or $5$-cycles in a worst-case instance had been the obstacle towards resolving major open questions. We present a new technique for efficiently removing almost all short cycles in a graph without unintentionally removing its triangles. Consequently, triangle finding problems do not become easy even in almost $k$-cycle free graphs, for any ...
[לנוסח המלא]

FLOC 2022: The Eighth Federated Logic Conference (FLoC 2022,July 31-August 12, 2022, Haifa, Israel) Hosted by the Henry and Marilyn Taub Faculty of Computer Science at the Technion ABOUT FLOC During the past forty years there has been extensive, continuous, and growing interaction between logic and computer science. In many respects, logic provides computer science with both a unifying foundational framework and a tool for modeling. In fact, logic has been called “the calculus of ...
[לנוסח המלא]

Synonymous codons translate into the same amino acid. Although the identity of synonymous codons is often considered inconsequential to the final protein structure there is mounting evidence for an association between the two. Protein structure plays an important role in understanding the biological function and mechanism of a protein therefore understanding the relations between protein structures and their genetic coding is crucial. Our study examined the association between the two by using regression and classification ...
[לנוסח המלא]

Creating digital 3D objects has been a central task across different disciplines and the key towards democratizing the metaverse. However, 3D content creation is still a privilege reserved for professional modelers because existing content creation tools are difficult to use by the general public. My research aims to lower the difficulty of 3D content creation to the point where everyone can manipulate digital 3D shapes. In this talk, I will first discuss how to build ...
[לנוסח המלא]

The problem of three-dimensional reconstruction from planar cross-sections arises in many fields, such as biomedical image analysis, and geographical information systems. The problem has been studied extensively in the past~40 years. Each cross-section of the input contains multiple contours, where each contour divides the plane into different material types. The reconstructed three-dimensional object is a valid volume (surrounded by a closed surface) that interpolates the input slices. Some existing works utilize prior information about the ...
[לנוסח המלא]

In this thesis, we study the modeling of human faces. As all structured data is believed to reside on some low-dimensional manifold in a high-dimensional space, we wish to study and model the so-called manifold of human faces. By uncovering the latent manifold of faces one can project onto the manifold (facial reconstruction) as well as sample from the manifold (facial synthesis), two tasks with a wide range of applications such as gaming, animation, and ...
[לנוסח המלא]

Concurrent multi-player games with omega-regular objectives are a standard model for systems that consist of several interacting components, each with its own objective. The standard solution concept for such games is Nash Equilibrium (NE), which is a ``stable'' strategy profile for the players. In many settings, the system is not fully observable by the interacting components, e.g., due to internal variables. Then, the interaction is modelled by a partial information game. Unfortunately, the problem of ...
[לנוסח המלא]

The rapid deployment of multi-core architectures has resulted in a dire need for scalable and reliable concurrent algorithms. This dissertation focuses on the design of concurrent data structures, which constitute building blocks for concurrent algorithms. Two major design goals in this domain are reliability and efficiency. This talk will concentrate on the hardness of reclaiming concurrent data-structures' memory efficiently, while taking care to preserve reliability. It will include (1) the design of a novel and ...
[לנוסח המלא]

The All-Pairs Max-Flow problem (APMF) asks to compute the maximum flow (or equivalently, the minimum cut) between all pairs of nodes in a graph. The naive solution of making n^2 calls to a (single-pair) max-flow algorithm was beaten in 1961 by a remarkable algorithm of Gomory and Hu that only makes n-1 calls. Within the same time bound, their algorithm also produces a cut-equivalent tree (a.k.a. GH-Tree) that preserves all pairwise minimum cuts exactly. This ...
[לנוסח המלא]

Despite their growing popularity, graph neural networks (GNNs) still suffer from multiple unsolved problems, including lack of embedding expressiveness, propagation of information to distant nodes, and training on large-scale graphs. Understanding the roots of and providing solutions for such problems require developing analytic tools and techniques. In this talk we provide a measure theoretic point of view for the above-mentioned problems, and derive a notion of “recoverability” which will serve us as a tool for ...
[לנוסח המלא]

We study the problem of routing real-time flows over a multi-hop mmWave mesh. We develop a model-free Deep Reinforcement Learning algorithm that determines which subset of the mmWave links should be activated during each time slot and using what power level. The proposed algorithm, called AARL (Adaptive Activator RL), can handle a variety of network topologies, packet loads and interference models. It does not require prior knowledge of the interdependence of different mmWave links or ...
[לנוסח המלא]

In this thesis, we deal the approximation problem of the growth rate of polycubes in three dimensions. We consider three-dimensional polycubes, which are finite collections of face-connected 3D-cubes, centered in points of $\mathbb{Z}^3$, where the lexicographically smallest cube is centered in $(0,0,0)$. If we denote the number of 3D polycubes comprised of $n$ cubes by $A(n)$, then we know from prior results that this sequence behaves like an exponential, and so we denote its growth ...
[לנוסח המלא]

Protocol Inference is the process of gaining information about a protocol from a binary code that implements it. This process is useful in cases such as extraction of the command and control protocol of a malware, uncovering security vulnerabilities in a network protocol implementation or verifying conformance to the protocol's standard. Protocol inference usually involves time-consuming work to manually reverse engineer the binary code. We present a novel method to automatically infer state machine of ...
[לנוסח המלא]

הנכם מוזמנים ליריד הפרוייקטים של הפקולטה למדעי המחשב ע"ש טאוב לסמסטר אביב תשפ"ב, אשר ובו יציגו וידגימו 30 צוותים של סטודנטים לתואר ראשון פרוייקטים בתחומים שונים במערכות IoT, אנדרואיד ארדואינו ורשתות, שפותחו במסגרת פרוייקט הגמר במסלול להנדסת תוכנה וברשתות תקשורת, רובם בוצעו בשיתוף עם עמותות חברתיות וארגונים שונים, ונועדו להוות תרומה לקהילה. היריד יתקיים ביום ראשון ,26 ביוני, 2022, בין השעות 14:00-16:00, בלובי בניין טאוב למדעי המחשב. הפרוייקטים המציגים
[לנוסח המלא]

A central problem in cryptanalysis is to find all the significant deviations from randomness in a given $n$-bit cryptographic primitive. When $n$ is large, the only practical way to find such statistical properties was to exploit the internal structure of the primitive and to speed up the search with a variety of heuristic rules of thumb. However, such bottom-up techniques can miss many properties, especially in cryptosystems which are designed to have hidden trapdoors. In ...
[לנוסח המלא]

A canonical communication problem Search(ϕ) is defined for every unsatisfiable CNF ϕ: an assignment to the variables of ϕ is distributed among the communicating parties, they are to find a clause of ϕ falsified by this assignment. Lower bounds on the randomized k-party communication complexity of Search(ϕ) in the number-on-forehead (NOF) model imply tree-size lower bounds, rank lower bounds, and size-space tradeoffs for the formula ϕ in the semantic proof system Tcc(k,c) that operates with ...
[לנוסח המלא]

Large scale Mega-models are impossible to train using standard hardware, but encompass a vast semantic understanding of our world. In this talk, I explore three ways to leverage the knowledge encompassed in the Recent Large scale"Contrastive Language-Image Pre-training" (CLIP) model, as a foundation to push the boundaries of generative capabilities: - InStyleGAN-NADA, we show how to adapt the StyleGAN generator across a multitudeof domains characterized by diverse styles and shapes. Notably, the native editing capabilities ...
[לנוסח המלא]

From 3D modeling to autonomous driving, a variety of applications can benefit from data-driven reasoning about geometric problems. The available data and preferred shape representation, however, varies widely from one application to the next. Indeed, the one commonality among most of these settings is that they are not easily approached using data-driven methods that have become de rigueur in other branches of computer vision and machine learning. In this talk, I will summarize recent efforts ...
[לנוסח המלא]

הנכן מוזמנות לאירוע השנתי של קהילת הסטודנטיות בפקולטה למדעי המחשב בטכניון ביום ראשון 19 ביוני, 2022, החל מהשעה 19:00 במרפסת טאוב. בתוכנית: 19:00 - מינגלינג, סושי ובירות 20:00 - מופע סטאנד-אפ של מור חן 21:00 - אפטרפארטי קריוקי נא להירשם מראש (ההרשמה לאירוע כרוכה בתשלום סמלי)
[לנוסח המלא]

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 ...
[לנוסח המלא]

הנכם מוזמנים להרצאת העשרה טכנולוגית, מפי נאוה לוי, AI/ML Dev Advocate, חברת Redis, על למידת מכונה בתעשיית ההייטק, בדגש על למידת מכונה בזמן אמת, ועל ההבדל בינה לבין למידה עמוקה והאתגרים ב-Real-time AI, על תפקידים ותחומי האחריות של צוות מדעי נתונים ולמידת מכונה טיפוסי בחברה בתעשייה, על הבדלים בין מחקר לפרקטיקה, ועל כלים שאיתם אפשר להתחיל כבר היום. ההרצאה תתקיים בזום ביום שלישי 14 ביוני, 18:30 וקישור לפגישה יישלח לאחר הרשמה מראש.
[לנוסח המלא]

הנכם מוזמנים לאירוע TRX'22: Technion Robotics Expo ביום ראשון, 12- ביוני, 2022, 16:30-20:00, באודיטוריום 1, בניין טאוב למדעי המחשב. נא להירשם מראש. פרטים נוספים ותוכנית.
[לנוסח המלא]

The problem of repairing linear codes, particularly Reed Solomon (RS) codes, has attracted a lot of attention in recent years due to its importance in distributed storage systems. In this problem, a failed code symbol (node) needs to be repaired by downloading as little information as possible from a subset of the remaining nodes. There are examples of RS codes with efficient repair schemes, and some are even optimal. However, these schemes fall short in ...
[לנוסח המלא]

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

The microprocessor is 50 years old. 50 years ago, a single ALU at kHz speeds had to be shared by multiple tasks, multiple applications, multiple users and multiple organizations. Due to transistor scaling we can now have 1M ALUs on a chip at GHz speeds. In this talk I will swap the cause and effect equation, instead of talking about solutions to problems, I will talk about problems created by solutions. Today data movement dominates ...
[לנוסח המלא]

3D printing is based on layered manufacturing, where the layers are printed consecutively in increasing height order. In Fused Depositing Modeling (FDM), the printing head may travel without extruding material between separated “islands” of the sliced layers. These travel movements increase the printing time and reduce the quality of the 3D printed part. We present an extended nozzle modification, which can be applied to off-the-shelf FDM printers, and a corresponding toolpath generation algorithm. Together, these ...
[לנוסח המלא]

הנכם מוזמנים למפגש מקוון בהדרכת יעל מרום, מנהלת מוצר חיסכון בחברת RiseUp, בנושא: איך להיות "על זה" כלכלית, שיסביר בצורה מעמיקה מהי תמונת המצב הכלכלית החודשית שלנו ואיך אפשר לדעת כמה באמת יש לנו להוציא, איך אפשר להיערך קדימה, לטווח הקצר ולטווח הרחוק כדי לבנות בהדרגה את הצמיחה הכלכלית שלנו, ביום שלישי, 7 ביוני, בשעה 18:30 לקישור לפגישה נא להירשם מראש
[לנוסח המלא]

Graph neural networks (GNNs) have shown broad applicability in a variety of domains. These domains, e.g., social networks and recommendation systems, are fertile ground for malicious users and behavior. In a series of works, we study the robustness of GNNs under different scenarios and present a simple rotation and permutation equivariant point-cloud GNN. We show that GNNs are vulnerable to the scenario of strategic behavior of multiple users (i.e., Strategic Classification) and to the extremely ...
[לנוסח המלא]

Given a finite point set $P$ in $R^d$, and $\eps>0$ we say that a point set $N$ in $R^d$ is a weak $\eps$-net if it pierces every convex set $K$ with $|K\cap P|\geq \eps |P|$. Let $d\geq 3$. We show that for any finite point set in $R^d$, and any $\eps>0$, there exists a weak $\eps$-net of cardinality $o(1/\eps^{d-1/2})$. Here $delta>0$ is an arbitrary small constant. This is the first improvement of the bound of ...
[לנוסח המלא]

נציגי Vayyar יגיעו לפקולטה להדגים טכנולוגיות חיישני תלת-ממד המסוגלים לראות דרך עצמים, ולהרצאה ב-13:30 על הדמייה תלת-ממדית ב-RF מפי אורי אדר מקבוצת סיסטם בחברה, ביום רביעי, 1 ביוני, 2022, בין 10:30-14:30, בלובי בניין טאוב למדעי המחשב. נא להירשם מראש להרצאה.
[לנוסח המלא]

StyleGAN is already quite famous for its unremarkable image editing capabilities. Although other generative models (e.g. diffusion models) achieve comparable synthesis quality, they cannot reproduce these semantically richmanipulations. In particular, StyleGAN allows the modification of various attributes, such as hair, age, pose, expression, and make-up, while still maintaining a high level of realism. Yet, it is still challenging to leverage these traits for real data or new domains. In this talk, we discuss three main ...
[לנוסח המלא]

הנכם מוזמנים להרצאה טכנולוגית מפי דיקלה דותן כהן, מנהלת המחקר של חברת מיקרוסופט, בנושא Improving Productivity Through NLP אשר תציג את המתודולוגיה של מוצרי Office 365 ואת האתגרים שהיא מציבה, ביום שלישי, 24 במאי, 17:00, בחדר 337, בניין טאוב למדעי המחשב. נא להירשם מראש.
[לנוסח המלא]

הנכם מוזמנים להצטרף לתחרות התכנות-CS Hackathon- Doing Good בפקולטה למדעי המחשב, שתתקיים בימים חמישי-שישי, 19-20 במאי, 2022, בבניין טאוב למדעי המחשב, ואשר תעסוק השנה בנושא עשייה חברתית ותרומה לקהילה, ותתמקד בפיתוח פתרונות הנדסיים-טכנולוגיים להגברת נגישות לבעלי מוגבלויות, במטרה לסייע להם לשפר את איכות חייהם - הזדמנות ליצור ולבנות תוצרים חדשניים ובעלי ערך חברתי, לממש רעיונות יצירתיים המקדמים ערכים של מעורבות ותרומה לקהילה, וליצור שינוי אמיתי אשר ישפיע על מציאות חייהם של בעלי מוגבלויות בישראל. לרשות ...
[לנוסח המלא]

הנכם מוזמנים להרצאתה של מורן סמואל - מדליסטית פארלימפית ומדליקת משואה ביום העצמאות הקרוב - אשר תגיע לפקולטה לרגל האקתון מדעי המחשב 2022, שיעסוק השנה בפיתוח פתרונות להגברת נגישות לבעלי מוגבלויות, ותספר על חייה כספורטאית וכמנצחת, ביום חמישי, 19 במאי, 2022, בשעה 09:00 באודיטוריום 1, בניין טאוב למדעי המחשב. פרטים נוספים והרשמה מראש (מספר המקומות מוגבל).
[לנוסח המלא]

הנכם מוזמנים ליום זרקור של חברת CYE העוסקת במתן פתרונות אבטחה לארגונים, ביום רביעי, 18 במאי, 2022 החל מ-12:30 בלובי בניין טאוב, ובין 13:30-14:30 להרצאה טכנולוגית בנושא: "סייבר, תכנות ומה שביניהם" - תקיפות ואסטרטגיות באמצעות קוד - מפי אייל גרינברג, ממייסדי החברה ומוביל צוות המחקר. נא להירשם מראש.
[לנוסח המלא]

Consider planning a trip in a train network. In contrast to, say, a road network, the edges are temporal, i.e., they are only available at certain times. Another important difficulty is that trains, unfortunately, sometimes get delayed. This is especially bad if it causes one to miss subsequent trains. The best way to prepare against this is to have a connection that is robust to some number of (small) delays. An important factor in determining ...
[לנוסח המלא]

Distributed systems become more and more ubiquitous. These systems entail different instances of distributed computing problems, each with unique characteristics. In this talk, I will discuss my Ph.D. research on theoretical and algorithmic aspects of distributed computing. Specifically, I will focus on two works that represent different aspects of my research on non-explicit information exchange in distributed systems. I will start with a fundamental work on concepts of information transfer in a distributed fault-prone environment ...
[לנוסח המלא]

To model the self-sound of drones, acoustics analysis and high-fidelity computational fluid dynamic methods can be used. However, these methods require significant computational resources. Therefore, data-driven and analytical methods are commonly used to model the sound source, enabling the generation of a pressure-time history of the moving rotors along a time varying shaft position. We suggest a simple and low computational data-driven method for modeling the sound source of a drone in free space and ...
[לנוסח המלא]

Are all SNARG constructions in the random oracle model inherently large? The answer to this question is still open, but I will survey recent work that makes significant progress towards a solution. In particular, we will see a new construction that achieves a smaller argument size. This is the first progress on the Micali construction since it was introduced over 25 years ago. Our construction relies on a strong soundness notion for PCPs and a ...
[לנוסח המלא]

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

This talk is about low-level fundamental visual motion cues that can help autonomous vehicles navigate in unknown structured and unstructured environments. Following bio-inspired and behavior-based observations and motivations, the talk focuses on relevant concepts and recent results as obtained from simulated and real data. Some of the visual cues, e.g., the“visual looming” cue, are environment, scale, and rotation independent, and are measured in time units. Obtaining the visual cues needs only one camera and does ...
[לנוסח המלא]

The growing popularity of Blockchain networks attracts also malicious and hacking users. Effectively detecting inappropriate and malicious activity should thus be a top priority for safeguarding blockchain networks and services. Blockchain behavior analysis can be used to detect unusual account activities or time periods with network-wide irregular properties. Thus, optimized anomaly detection based on historical data is an essential task for securing transactions and services. However, processing the complete blockchain history can be slow and ...
[לנוסח המלא]

הנכם מוזמנים ליום זרקור של חברת פיקויא (חברת סטארט אפ בתחום הפרסום וקידום משחקי אונליין), ולמפגש עם מהנדסים וצוותי גיוס, אשר יתקיים ביום שני, 9 באי, 2022, החל מהשעה 10:00, בקומת הכניסה לבניין טאוב. כולם מוזמנים!
[לנוסח המלא]

הנכם מוזמנים לסדנת לינקדין מעשית, בהדרכת ענת קיגל טאוב, מנהלת צוות הסורסינג ב-Meta, אשר תעניק טיפים שיעזרו למתג את עצמכם בפני המגייסים, המנהלים והשותפים לעבודה העתידיים, ביום שני, 2 במאי, 2022, בשעה 18:30 בטאוב 337. נא להירשם מראש
[לנוסח המלא]

A central challenge in building robotic prostheses is the creation of a sensor-based system able to read physiological signals from the lower limb and instruct a robotic hand to perform various tasks. Existing systems typically perform discrete gestures such as pointing or grasping, by employing electromyography (EMG) or ultrasound (US) technologies to analyze the state of the muscles. In this research, we study the inference problem of identifying the activation of specific fingers from a ...
[לנוסח המלא]

Payment channel networks (PCNs) provide a faster and cheaper alternative to transactions recorded on the blockchain. Clients can trustlessly establish payment channels with relays by locking coins and then send signed payments that shift coin balances over the network’s channels. Although payments are never published, anyone can track a client’s payment by monitoring changes in coin balances over the network’s channels. We present Twilight, the first PCN that provides a rigorous differential privacy guarantee to ...
[לנוסח המלא]

Robust mechanism design is a rising alternative to Bayesian mechanism design, which yields designs that do not rely on assumptions like full distributional knowledge. We apply this approach to mechanisms for selling a single item, assuming that only the mean and range of the distribution of buyer values is known. We seek the mechanism that maximizes revenue over the worst-case distribution compatible with the known parameters. Such a mechanism arises as an equilibrium of a ...
[לנוסח המלא]

Interactive coding allows two or more parties to carry out a distributed computation over a communication network that may be noisy. The ultimate goal is to develop efficient coding schemes that tolerate a high level of noise while increasing the communication by only a constant factor (i.e., constant rate). In this work we provide computationally efficient, constant rate schemes that conduct any computation on arbitrary networks, and succeed with high probability in the presence of ...
[לנוסח המלא]

Multivariate time series forecasting differs from univariate time series forecasting by trying to model the dependencies between the different time series in order to make a more precise forecasting. Despite reaching better results in a multivariate setting, classical and deep learning multivariate models are not scalable, having their total number of parameters growing square of the number of time-series. We present in this paper a novel paradigm in how deep learning models shall be adapted ...
[לנוסח המלא]

הנכם מוזמנים ליום זרקור מטעם חברת פיליפס ולהיפגש עם המהנדסים וצוותי הגיוס שלה, ביום שלישי, 12 באפריל, 2022, החל משעה 11:00, בלובי טאוב. כולם מוזמנים!
[לנוסח המלא]

הנכם מוזמנים לסדנת אינטל להכנה לחלק הטכני בראיון עבודה ביום שני, 11 באפריל, 2022,  18:00, בפגישת זום - קישור יישלח לאחר הרשמה מראש. כולם מוזמנים!
[לנוסח המלא]

Simultaneous localization and mapping (SLAM) is essential in numerous robotics applications such as autonomous navigation. Traditional SLAM approaches infer the metric state of the robot (position and orientation) along with a metric map of the environment. While existing algorithms exhibit good results, they are still sensitive to measurement noise, sensors quality, data association and are still computationally expensive. Computational load is especially problematic in active planning. Alternatively, we note that some navigation and mapping missions ...
[לנוסח המלא]

הנכם מוזמנים למפגש המחקר הראשון עם התמקדות ב-NLP, ביום רביעי, 6 באפריל, 18:30 במרפסת טאוב. מטרת המפגש היא להפגיש את קהילות ה-ML וה-NLP בישראל בסביבה פחות רשמית מהסמינר/הכנס/הפוסטר המסורתי והמוכר. מתכונת האירוע תהיה כדלקמן: - הלילה ייפתח בנאום מהיר של פרופסור יונתן בלינקוב - מפגש סטודנטים לכל התארים, חוקרים וחברי סגל עם נציגי חברות (אמזון, י.ב.מ, מיקרוסופט, גוגל, גונג ועוד) בשולחנות עגולים - במסגרת השולחנות העגולים, מוזמנים חוקרים לדון בבעיות מעניינות עמם הם מתמודדים במסגרת ...
[לנוסח המלא]

Quantum money is a main primitive in quantum cryptography, that enables a bank to distribute to parties in the network, called wallets, unclonable quantum banknotes that serve as a medium of exchange between wallets. While quantum money suggests a theoretical solution to some of the fundamental problems in currency systems, it still requires a strong model to be implemented; quantum computation and a quantum communication infrastructure. A central open question in this context is whether ...
[לנוסח המלא]

We study a geometrically constrained combinatorial problem inspired by the following scenario: autonomous vehicles move on a $m$-lane freeway, where $m \geq 2$. Each vehicle heads to some destination and is allowed to exit the road only through a designated exit lane when approaching its destination. We assume that vehicles have limited memory and sensing capabilities, and cannot directly communicate with their peers. We present a completely decentralized distributed algorithm that allows vehicles to get ...
[לנוסח המלא]

In this thesis, we study temporal graphs and how to best represent their nodes and edges for multiple classification tasks. We first study the basics of how to represent nodes and edges in (un)weighted and (un)directed temporal graphs. We then present methods to leverage different aspects of temporal graphs, such as a temporal message passing and multiple attributes over edges. Finally, we study how bias manifests itself in temporal graphs and propose methods to balance ...
[לנוסח המלא]

During the last decade, Neural Networks (NNs) have proved to be extremely effective tools in many fields of engineering, including autonomous vehicles, medical diagnosis and search engines, and even in art creation. Indeed, NNs often decisively outperform traditional algorithms. One area that is only recently attracting significant interest is using NNs for designing numerical solvers, particularly for discretized partial differential equations. Several recent papers have considered employing NNs for developing multi-grid methods, which are a ...
[לנוסח המלא]

Uncertainty is a key factor in real-time systems, where decisions must be made over time based on incomplete or partial information. Competitive analysis is the prominent paradigm for the design and analysis of algorithms for such environments, which are called online algorithms. The field of competitive analysis has been studied extensively throughout the last few decades, and is highly useful in the analysis of such real-time systems. In an online problem data is revealed over ...
[לנוסח המלא]

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

Alice receives a non-periodic string (such as ABCDEF), while Bob receives a string (such as CDEFAB), obtained by applying a hidden cyclic shift to Alice’s string. Alice and Bob query their strings in a small number of positions (sublinear in the amount of shifting) and then exchange a single short message. How can they detect the shift with minimal error probability? Based on Joint works with Elette Boyle, Itai Dinur, Niv Gilboa, Yuval Ishai, Nathan ...
[לנוסח המלא]

In this CE club session, we will present three papers that will appear next week at NSDI'22: Scaling Open vSwitch with a Computational Cache by Alon Rashelbach Open vSwitch (OVS) is a widely used open-source virtual switch implementation. In this work, we seek to scale up OVS to support hundreds of thousands of OpenFlow rules by accelerating the core component of its data-path – the packet classification mechanism. To do so we use NuevoMatch, a ...
[לנוסח המלא]

In distributed differential privacy, the parties perform analysis over their joint data while preserving the privacy for both datasets. Interestingly, for a few fundamental two-party functions such as inner product and Hamming distance, the accuracy of the distributed solution lags way behind what is achievable in the client-server setting. McGregor, Mironov, Pitassi, Reingold, Talwar, and Vadhan [FOCS ’10] proved that this gap is inherent, showing upper bounds on the accuracy of (any) distributed solution for ...
[לנוסח המלא]

היום הפתוח במדעי המחשב בטכניון מזמין בוגרי תואר ראשון מצטיינים מכל האוניברסיטאות להירשם ללימודי תארים מתקדמים בפקולטה למדעי המחשב בסמסטר חורף תשפ"ב. האירוע יתקיים ביום ד', 23 במרץ, 2022, בין השעות 12:30-14, חדר 337, בניין טאוב למדעי המחשב בטכניון. תוכנית היום תכלול סקירה על מהלך לימודי תארים מתקדמים, על המחקר ועל החיים בפקולטה למדעי המחשב בטכניון: 12:40-12:30 - דבר דיקן הפקולטה, פרופ' דן גייגר 13:00-12:40 - דבר סגן הדיקן לתארים מתקדמים, פרופ' גיל ברקת 13:20-13:00 ...
[לנוסח המלא]

Common studies of gender bias in natural language processing (NLP) focus either on extrinsic bias which is measured by model performance on a specific task or on intrinsic bias which is measured on a models' internal representations. However, the relationship between extrinsic and intrinsic bias is relatively unknown. In this work, we illuminate this relationship by measuring both quantities together: we debias a model during downstream fine-tuning, which reduces extrinsic bias, and measure the effect ...
[לנוסח המלא]

תלמידי הפקולטה למדעי המחשב מוזמנים ליום זרקור של חברת NVIDIA אשר יתקיים ביום שני, 21 במרס, 2022, 12:00, קומת הכניסה לבניין טאוב למדעי המחשב. כולם מוזמנים.
[לנוסח המלא]

Correcting insertions/deletions as well as substitution errors simultaneously plays an important role in DNA-based storage systems as well as in classical communications. However, in DNA data storage as well as in file/symbol synchronization, not only insertions/deletions occur, but also classical substitution errors. Additionally, some cases feature array-like words and as such pose a new type of variance in insertions/deletions errors - column insertions/deletions as opposed to row insertions/deletions. In the work presented, both cases are ...
[לנוסח המלא]

Semantic perception is the process of acquiring and maintaining knowledge of the environment of a robot (or more generally - embodied agent) beyond geometric structure, i.e. capturing meaning - such as classes and other high-level properties of visible scene elements - as opposed to pure geometry. Semantic perception is key to enabling autonomous robots to operate in diverse, low-structured and dynamic environments and alongside humans. In the past decade semantic information has become increasingly available ...
[לנוסח המלא]

יום הכוון בפקולטה למדעי המחשב תשפ"ב 2022 לסטודנטים חדשים יתקיים ביום שלישי, 15 במרס, 2022, ויחל בשעה 10:00 במפגש טכניוני במפגש טכניוני בבניין צ'רצי'ל ובו ישאו דברים המשנה הבכיר לנשיא, דיקן לימודי הסמכה ודיקנית הסטודנטים ויו"ר אגודת הסטודנטים בטכניון, ובין השעות 11:00-14:00 תתקיים התכנסות ומפגש פקולטי בבניין טאוב למדעי המחשב, באודיטוריום 1 בקומת הכניסה, אשר יכלול סיורים בפקולטה, קבלת כרטיס סטודנט, היכרות עם חברי הסגל האקדמי ומזכירות לימודי הסמכה וכן פגישה עם נציגי אגודת הסטודנטים, ...
[לנוסח המלא]

Simultaneous multithreading (SMT) increases the cost of memory address translation due to sharing of the translation lookaside buffer (TLB) among multiple threads. Current x86 processors use a ``competitively-shared’’ TLB, in which low-locality threads might needlessly waste TLB resources and thus degrade the performance of neighboring high-locality threads. To address this problem, we introduce PartTLB, a new mechanism that: (1) samples the TLB requests of the competing threads, (2) predicts their miss rate with different TLB ...
[לנוסח המלא]

Studies that evaluate new architectural designs of virtual memory typically employ a ``model-based’’ methodology that relies on simulations of the translation lookaside buffer (TLB) coupled with empirical performance models. We observe that this methodology is limited in that each simulated thread of execution has its own dedicated TLB, whereas modern processors share a single TLB among multiple threads through ``simultaneous multithreading’’ (SMT). Existing model-based research is thus unable to explore virtual memory designs in SMT ...
[לנוסח המלא]

Neural language models have significantly developed in recent years, becoming more and more successful on numerous language tasks. Those models rely on encoding words as hidden vector representations, before utilizing these representations for the task at hand. Their success spiked interest in their interpretability: understanding how they work, and what is encoded within these representations. While many studies have shown that linguistic information is encoded in hidden word representations, few have studied individual neurons of ...
[לנוסח המלא]

Protecting intellectual properties from untrusted design houses and foundries has become highly challenging. In this talk, I will focus on the security aspects of embedded systems. First, I will discuss the logic locking tools and attack methods developed at the Institute for Communication Technologies and Embedded Systems, RWTH Aachen University. In the second part of the talk, I will focus on developing low-power, high-performance embedded systems based on emerging non-volatile memory technologies. These methods incorporate ...
[לנוסח המלא]

Graph isomorphism testing is usually approached via the comparison of graph invariants. Two popular alternatives that offer a good trade-off between expressive power and computational efficiency are combinatorial (i.e., obtained via the Weisfeiler-Leman (WL) test) and spectral invariants. While the exact power of the latter is still an open question, the former is regularly criticized for its limited power, when a standard configuration of uniform pre-coloring is used. This drawback hinders the applicability of Message ...
[לנוסח המלא]

In model checking, we work toward deciding whether a system satisfies a given specification. Often, a system exhibits some type of symmetry in its structure or in its behaviour. Such symmetries can be exploited by a designer to alleviate some of the complexity of model checking, as well as to gain insight into the behaviour of the system. Thus, we want to decide whether a given system exhibits symmetry. Symmetry is not a well-defined concept ...
[לנוסח המלא]

מפגש מתעניינים בלימודים בטכניון ובפקולטה למדעי המחשב יתקיים באופן מקוון בפייסבוק מדעי המחשב, ביום חמישי, 24 בפברואר, 2022, בשעה 10:00 ובשעה 14:00 פרטים והרשמה
[לנוסח המלא]

MLIS, מרכז הבינה המלאכותית של הטכניון, בשיתוף עם TCE מזמינים אתכם להשתתף בכנס MILS-TCE. בינה מלאכותית היא כעת מילת מפתח בכל והציפיות מרקיעות שחקים, אבל מהי הטכנולוגיה העדכנית האמיתית ומה ניתן ליישם בפועל בתחומי הבינה המלאכותית ו-Machine Learning? בסדרת הרצאות יציגו חוקרי הטכניון מחקר AI חדשני שנערך במוסד. במקביל, בסדנאות נושא, נחקור את תפקידם של AI ומדעי הנתונים בתחומי החינוך והתכנון העירוני. פרטים נוספים, הרשמה ותוכנית הרשמת EARLY BIRD עד 1 בפברואר 2022.
[לנוסח המלא]

Complex Event Processing (CEP) are a set of methods that allow efficient knowledge extraction from massive data streams using complex and highly descriptive patterns. As of today, in many fields, patterns are manually defined by human experts. However, desired patterns often contain convoluted relations that are difficult for humans to detect, and human expertise is scarce in many domains. We present REDEEMER, a novel reinforcement and active learning approach aimed at mining CEP patterns that ...
[לנוסח המלא]

The ability to detect complex patterns in massive data streams is critical for many real-time applications. These applications must uphold low latency requirements, delivering alerts and notifications with minimal response delays. Complex event processing (CEP), a leading technology for performing this task, is suitable for the efficient and robust detection of complex patterns. However, the CEP complexity grows exponentially with respect to the length of the pattern and the intensity of the data stream. As ...
[לנוסח המלא]

Point clouds are gaining prominence as a method for representing 3D shapes, but their irregular structure poses a challenge for deep learning methods. In this paper we propose CloudWalker, a novel method for learning 3D shapes using random walks. Previous works attempt to adapt Convolutional Neural Networks (CNNS) or impose a grid or mesh structure to 3D point clouds. This work presents a different approach for representing and learning the shape from a given point ...
[לנוסח המלא]

Neural networks that are based on unfolding of an iterativesolver, such as LISTA (learned iterative soft threshold algorithm), are widelyused due to their accelerated performance. Nevertheless, as opposed tonon-learned solvers, these networks are trained on a certain dictionary, andtherefore they are inapplicable for varying model scenarios. This talkintroduces an adaptive learned solver, termed Ada-LISTA, which receives pairsof signals and their corresponding dictionaries as inputs, and learns auniversal architecture to serve them all. We prove that ...
[לנוסח המלא]

Deduplication reduces the size of the data stored in large-scale storage systems by replacing duplicate data blocks with references to their unique copies. This creates dependencies between files that contain similar content and complicates the management of data in the system. In the work presented in this seminar, we have addressed the problem of data migration, where files are remapped between different volumes because of system expansion or maintenance. The challenge of determining which files ...
[לנוסח המלא]

Deduplication is a leading method for reducing physical storage capacity when duplicate data is present. This method can be applied on chunks, files, containers, and more. Instead of storing the same physical data multiple times, a pointer is created from each logical copy to the same physical copy, saving the space of the duplicate data. Due to this, data is shared between objects, such as files or entire directories, which result in garbage collection overhead ...
[לנוסח המלא]

Range matching (RM) is a crucial component in computer systems, widely used in address translation, hard drives, network switches, and many more applications. RM is performed whenever one wishes to locate a range that contains an input number, given a large set of ranges. Any page-based mechanism uses RM, as pages are basically ranges. Longest prefix matching (LPM) uses ternary rules, which are also ranges. Firewalls are one example of multidimensional RM since ACL rules ...
[לנוסח המלא]

The inline processing technique enables data transformation as a system transfers data to or from a processing node. It is used to offload computations and accelerate data-intensive communication tasks, reducing latency and power due to data movement and improving throughput by using the best processing core for the job. However, inline processing poses several challenges: it breaks existing operating system and network stack layers and makes it difficult to reuse previous software and hardware. This ...
[לנוסח המלא]

We propose a novel quasi-Newton method for solving the sparse inverse covariance estimation problem also known as the graphical least absolute shrinkage and selection operator (GLASSO). This problem is often solved using a second order quadratic approximation. However, in such algorithms the Hessian term is complex and computationally expensive to handle. To this end,our algorithm uses the inverse of the Hessian as a preconditioner to simplify and approximate the quadratic element at the cost of ...
[לנוסח המלא]

Leveragingthe characteristics of convolutional layers, neural networks are extremelyeffective for pattern recognition tasks. However in some cases,their decisions are based on unintended information leading to high performanceon standard benchmarks but also to a lack of generalization to challengingtesting conditions and unintuitive failures. Recentworkhas termed this “shortcut learning” and addressed its presence in multipledomains. In text recognition, we reveal another such shortcut, whereby recognizersoverly depend on local image statistics. Motivated by this, we suggest anapproach to ...
[לנוסח המלא]

Constrained Horn Clauses (CHCs) is a fragment of First Order Logic (FOL), that has gained a lot of attention in recent years. One of the main reasons for the rising interest in CHCs is the ability to reduce many verification problems to satisfiability of CHCs. For example, program verification can naturally be described as the satisfiability of CHCs modulo a background theory such as linear arithmetic and arrays. To this end, CHC-solvers can be used ...
[לנוסח המלא]

a large batch of real or simulated robot interaction data, using some data collection policy, and then learn from this data to perform various tasks, using offline learning algorithms. Previous work focused on manually designing the data collection policy, and on tasks where suitable policies can easily be designed, such as random picking policies for collecting data about object grasping. For more complex tasks, however, it may be difficult to find a data collection policy ...
[לנוסח המלא]

Current geometry methods for creating and manipulating shapes on computers can sometimes be unreliable and fail unpredictably. Such failures make geometry tools hard to use, prevent non-experts from creating geometry on their computers, and limit the use of geometry methods in domains where reliability is critical. We will discuss my recent efforts in proving when existing methods work as intended, my work in making methods more robust to imperfect input, my work in the creation ...
[לנוסח המלא]

As the field of deep learning progresses, and models become larger and larger, training deep neural networks has become a demanding task. The task requires a huge amount of compute power, and can still be very time consuming - especially when using just a single GPU. To tackle this problem, distributed deep learning has come into play, with various asynchronous training algorithms. However, most of these algorithms suffer from decreased accuracy as the number of ...
[לנוסח המלא]

Symmetric ciphers are cryptographic algorithms that use the same cryptographic keys for both encryption and decryption. The key represents a shared secret between users, that is used to maintain a private information link. In our research we focus on cryptanalysis of block ciphers, which are the most widely used realization of symmetric ciphers. Block ciphers are cryptosystems that consist of two algorithms, an encryption algorithm that accepts a symmetric key and a plaintext and outputs ...
[לנוסח המלא]

Face recognition systems are frequently used in a variety of security applications in our daily lives. Some methods are designed to utilize geometric information extracted from depth sensors to overcome single-image-based recognition technologies’ weaknesses, such as vulnerability to illumination variations, large head poses, and spoofing attacks. However, the accurate acquisition of the depth profile or surface is an expensive and challenging process. We introduce a novel method to recognize faces from stereo camera systems without ...
[לנוסח המלא]

We present an algorithm for producing a seamless animated loop from a single image. The algorithm detects periodic structures, such as the windows of a building or the steps of a staircase, and generates a non-trivial displacement vector field that maps each segment of the structure onto a neighboring segment along a user- or auto-selected main direction of motion. This displacement field is used, together with suitable temporal and spatial smoothing, to warp the image ...
[לנוסח המלא]

Bitcoin was introduced to the world in 2009 with Proof of Work (PoW) Leader Election as one of its novel building blocks. Since then, much criticism has been made of its high energy consumption. Proof of Stake protocols aims at replacing PoW protocols as a much more efficient version while still maintaining its security properties under the Honest Majority model. In our work, we show a bribery attack under the Rational Majority model, which breaks ...
[לנוסח המלא]

Industrial Control Systems (ICSs), also known as Operation Technology (OT) systems, are distributed computerized systems designed to manage, monitor and control industrial processes. They are widely used in critical infrastructures, such as power plants and water supply, whose continuous operation is of major importance to modern life. Following the well-known Stuxnet attack on OT systems, a large investment in OT security was started. Though their cyber protection is crucial, they did not yet reach the ...
[לנוסח המלא]

The development of computing systems able to address our ever-increasing needs, especially as we reach the end of CMOS transistor scaling, requires truly novel methods of computing. My research draws inspiration from biology, rethinks the digital/analog boundary, and challenges conventional wisdom, which typically guides how we perform computation, by reimagining the role of time. In this talk, I first introduce a computational temporal logic that sets the foundation for temporal computing. Second, I demonstrate how ...
[לנוסח המלא]

The Pursuit Problem depicts a scenario where a moving target is pursued by an agent, whose movement is prescribed by some defined policy. Examples of what can be regarded as solutions to the pursuit problem include the shape of the agent's trajectory, whether the agent ultimately captures the target, and the circumstances of the capture, including the time required for capture to be achieved, The Unicycle Model is a popular simplification used to describe the ...
[לנוסח המלא]

Training deep neural networks in the distributed asynchronous setting is complicated. In the distributed asynchronous setting, the computational devices run in parallel, causing a delay in the propagation of information between the different computational devices. The delay is often referred to as staleness, which harms the training process and the quality of the deep neural network. This staleness is one of the main difficulties in scaling asynchronous settings to a large number of computational devices ...
[לנוסח המלא]

While image editing and manipulation tools have seen steady progress, allowing complex editing effects to be achieved by novice users, video editing remains a difficult task: applying edits in a temporally consistent manner to all frames remains a key challenge. In this talk, I’ll present a novel method that tackles this challenge by decomposing an input video into a set of layered 2D atlases, each providing a unified representation of an object/background over the entire ...
[לנוסח המלא]

Our world is constantly evolving, and so is the content on the web. Consequently, our languages, often said to mirror the world, are dynamic in nature. However, most current language representations are static and cannot adapt to changes over time. New words and semantic evolution have been shown to pose a crucial challenge in many Natural Language Processing and Information Retrieval tasks, leading to a significant performance drop for modern language models. In this thesis, ...
[לנוסח המלא]

Predictive machine learning tools are increasingly being used to inform decisions regarding humans. When human users stand to gain from certain predictive outcomes, they may be prone to act strategically to improve those outcomes. We argue that in many realistic scenarios the system and its users are in fact aligned in their goals. In this work, we give concrete real-world examples for such environments and demonstrate using a series of experiments that they are incentive-aligned. ...
[לנוסח המלא]

In this talk I will survey recent developments in approximate subgraph-counting and subgraph-sampling in sublinear-time. Counting and sampling small subgraphs (aka motifs) are two of the most basic primitives in graph analysis, and have been studied extensively, both in theory and in practice. In my talk, I will present the sublinear-time computational model, where access to the input graph is given only through queries, and will explain some of the concepts that underlie my results. ...
[לנוסח המלא]

הנכם מוזמנים לסדנת פיתוח אתרים מעשית שתכלול סקירת טכנולוגיות עדכניות של פיתוח אפליקציות Web ותרגול מעשי תוך הדגמה, בעזרת אורי שקד, Voiding warranties at Wokwi.com. הסדנה תתקיים ביום רביעי, 5 בינואר, 18:30, בפגישת זום, ורצוייה אך לא נדרשת היכרות עם שפת תכנות אחת לפחות כגון JavaScript ,React, Next.js וכן התקנת Visual Studio Code ו-Node.js להשתתפות בסדנה נא להירשם מראש.
[לנוסח המלא]

Domain adaptation setups were not all born equal, and some domains are easier to adapt to and from than others. This talk will show and attempt to estimate the difficulty (or ease) of adapting between different domains, based on the causal effect of certain features in the data on the adapting model’s predictions. This question is relevant in many real-life scenarios where computational resources exist in relative abundance, while labeling and data-gathering is time-consuming, expensive ...
[לנוסח המלא]

Despite recent advances in sensor technology, capturing high-speed video at high-spatial resolutionsremains a challenge. This is because, in a conventional camera, the available bandwidth limits either the maximum sampling frequency or thecaptured spatial resolution. In this talk, I am going to cover our recent works that use computational imaging to allow high-speed high-resolution imagingunder certain conditions. First I will describe Diffraction Line Imaging, a novel imaging principle that combines diffractive optics with 1D (line) sensorsto ...
[לנוסח המלא]

Data science has become prevalent in various fields that affect day-to-day lives, such as healthcare, banking, and the job market. The process of developing data science applications usually consists of several automatic systems that manipulate and prepare the data in different manners. Examples of automatic data manipulations and preparations include generating synthetic data, interactive data exploration, repairing the data, and labeling it for machine learning. These systems can be highly complex and even data scientists ...
[לנוסח המלא]

Recently, there has been a growing interest in harnessing the power of big datasets and modern machine learning for designing new scalable algorithms. This invites us to rethink the role of data in algorithm design: not just as the input to pre-designed algorithms, but also a factor that enters the algorithm design process itself, driving it in a strong and possibly automated manner. This talk will show how to leverage data and learning for better ...
[לנוסח המלא]