The Taub Faculty of Computer Science Events and Talks

We consider the 0-Extension problem, where we are given an undirected graph G=(V,E) equipped with non-negative edge weights w: E→ℝ+, a collection T={t1,…,tk}⊆V of k special vertices called terminals, and a semi-metric D over T. The goal is to assign every non-terminal vertex to a ...
[Full version]

Thin structures are ubiquitous, such as ropes, cables, tree branches, wire arts, and wire-frame furniture. It is well known that 3D thin structures are challenging to reconstruct due to their narrow width and lack of distinct features. However, their reconstruction has received relatively little research ...
[Full version]

Our research is focused on two distributed models that allow global communication. The first one is the well-known Congested Clique model and another is the recently introduced Hybrid network model. In this talk, I will present three scheduling algorithms for the Congested Clique model, which ...
[Full version]

Correlation Clustering is an elegant model where given a graph with edges labeled + or −, the goal is to produce a clustering that agrees the most with the labels: + edges should reside within clusters and − edges should cross between clusters. In this ...
[Full version]

Storage processors are a new type of acceleration device that offloads centerpiece storage stack functions from legacy software to high-performance hardware. The legacy software paradigms waste flash capacity and performance, pushing the users to deploy expensive and overprovisioned SSDs. For example, the high write amplification ...
[Full version]

3D computer vision has significantly advanced over the past several decades, with modern algorithms successfully reconstructing entire urban cities. However, many questions remain unexplored, as geometric reasoning alone cannot fully infer the connections among images capturing different parts of the scene or semantic relationships between ...
[Full version]

We introduce a new deep learning method for point cloud comparison. Our approach, named Deep Point Cloud Distance (DPDist), measures the distance between the points in one cloud and the estimated surface from which the other point cloud is sampled. The surface is estimated locally ...
[Full version]

Model checking is an automatic verification method that accepts a system model and a specification, and checks whether the model satisfies the specification. CTL is a branching temporal logic suitable for specifying behaviors of both software and hardware systems. In this work, we present a ...
[Full version]

Evolving applications such as autonomous vehicle teleoperation call for high-quality and low latency video transmission. Existing technology allows high-quality video to be transmitted over several parallel cellular channels, with suitable rate control. Leveraging these systems to vehicles in motion involves further challenges due to the ...
[Full version]

Programmable switches are advanced network switches that can be programmed to perform certain actions besides routing packets. Programmable switches enable combining the logic and flexibility of software with the speed and efficiency of hardware and thus enjoy the benefits of both. Interstingly, programmable switches are ...
[Full version]

We study the social efficiency of contracts as economic mechanisms when multiple principals simultaneously manage a common agent. We consider an incomplete-information setting: The agent chooses an unobservable action that induces both a cost for the agent and an expected value for each principal. The ...
[Full version]

We study the problem of maximizing a monotone submodular function subject to a Multiple Knapsack constraint (SMKP). The input is a set I of items, each associated with a non-negative weight, and a set of bins, each having a capacity. Also, we are given a ...
[Full version]

Almost two centuries ago Pierre-Joseph Proudhon proposed social contracts -- voluntary agreements among free people -- as a foundation from which an egalitarian and just society can emerge. A digital social contract is the novel incarnation of this concept for the digital age. Digital social ...
[Full version]

Recent advances in material science and digital fabrication provide promising opportunities for product design, mechanical and biomedical engineering, robotics, architecture, art, and science. Engineered materials and personalized fabrication are revolutionizing manufacturing culture and having a significant impact on various scientific and industrial works. As new ...
[Full version]

The ability to promptly and efficiently detect arbitrarily complex patterns in massive real-time data streams is a crucial requirement for a wide range of modern applications. The ever-growing scale of these applications and the sophistication of the patterns involved makes it imperative to employ advanced ...
[Full version]

Bayesian persuasion, as introduced by Kamenica and Gentzkow in 2011, is the study of information sharing policies among strategic agents. A prime example is signaling in online ad auctions: what information should a platform signal to an advertiser regarding a user when selling the opportunity ...
[Full version]

A streaming algorithm is given a long sequence of items and seeks to compute or approximate some function of this sequence using a small amount of memory. A body of work has been developed over the last two decades, resulting in optimal streaming algorithms for ...
[Full version]

In this talk i'll be covering several works in the topic of 3D deep learning on pointclouds for scene understanding tasks. First, I'll describe VoteNet (ICCV 2019): a method for object detection from 3D pointclouds input, inspired by the classical generalized Hough voting technique. I'll ...
[Full version]

Mutation score is widely accepted to be a reliable measurement for the effectiveness of software tests. Recent studies, however, show that mutation analysis is extremely costly and hard to use in practice. We present a novel direct prediction model of mutation score using neural networks. ...
[Full version]

We are living in an era where the digital world is becoming an inevitable part of our professional and daily lives. Digital creation tools are essential for many professions including design, entertainment, gaming etc. In our daily lives, we all take many pictures or capture ...
[Full version]

Motivated by applications in machine learning, such as subset selection and data summarization, we consider the problem of maximizing a monotone submodular function subject to mixed packing and covering constraints. We present a tight approximation algorithm that for any constant $\eps >0$ achieves a guarantee ...
[Full version]

In the "20 questions" game Alice picks a probability distribution over the set {1,...,n}, and draws a secret element x from it. Bob's goal is to construct a strategy to reveal x using only "Yes or No" questions, while minimizing the expected number of questions ...
[Full version]

Genome sequencing data is rising exponentially at a rate (125%/year) that is far higher than our current transistor performance scaling (currently 3%/year). New medical and comparative genomics applications have emerged that ensure that the demand for more sequencing will continue to rise, which threatens to ...
[Full version]

Image sensors capable of detecting individual photons are typically used in specialized low-light imaging applications. In this talk I will make a case for using time-resolved single-photon sensors as general-purpose image sensors, not limited to photon-starved scenarios. This may seem counterintuitive. Why would one want ...
[Full version]

Kirigami, the traditional Japanese art of paper cutting and folding generalizes origami and has initiated new research in material science as well as graphics. Jere we use its capabilities to perform geometric modeling with corrugated surface representations possessing an isometric unfolding into a planar domain ...
[Full version]

You are invited to the first CS CTF - Capture The Flag competition, in various subjects in programming, information security, algorithmics, artificial intelligence and more. The competition will be held in groups that will face challenges posed by large companies in the industry, faculty members, ...
[Full version]

The notion of list-decoding, introduced by Elias in the 1950s, is a natural generalization of unique decoding, where the decoder is allowed to output a list of codewords that contains the transmitted codeword instead of a single codeword. Besides being a fundamental concept in coding ...
[Full version]

State sharding is a common solution to the scalability problem in blockchain systems, allowing nodes to hold a partial view of the system state. With sharding, the processing of a transaction might not be completed locally within a node and potentially requires involvement of multiple ...
[Full version]

In this talk we explore two contributions for shape analysis. In a first case, we consider surfaces and how local analysis of the angular oscillations and polynomial radial behavior around surface points leads to accurate normal estimation and new integral invariants. A direct application of ...
[Full version]

RNNs are a class of Machine learning models used to solve tasks with sequential structure. Since most neural circuits are recurrent, RNNs are often deployed to explain neural activity during computational tasks with a temporal dimension. Unlike their natural counterparts, an RNN’s entire computation is ...
[Full version]

In this paper we introduce randomized branching as a tool for parameterized approximation and develop the mathematical machinery for its analysis. Our algorithms improve the best known running times of parameterized approximation algorithms for Vertex Cover and 3-Hitting Set for a wide range of approximation ...
[Full version]

Monitoring network traffic is an important building block for various management and security systems. In typical settings, the number of active flows in a network node is much larger than the number of available monitoring resources and there is no practical way to maintain "per-flow" ...
[Full version]

A major bottleneck in the evaluation of music generation is that music appreciation is a highly subjective matter. When considering an average appreciation as an evaluation metric, user studies can be helpful. The challenge of generating personalized content, however, has been examined only rarely in ...
[Full version]

A channel in the Lightning Network allows two parties to secure bitcoin payments and escrow holdings between them. Designed to increase transaction immediacy and reduce blockchain congestion, this has the potential to solve many issues associated with Bitcoin. In this talk, we study the economics ...
[Full version]

A common observation in data-driven applications is that high dimensional data has a low intrinsic dimension, at least locally. Thus, when one wishes to work with data that is not governed by a clear set of equations, but still wishes to perform statistical or other ...
[Full version]

The potential benefits of taking surface curvature into account in engineering design have not yet been fully utilized. One of the problems is that differential geometry is often not offered in the undergraduate engineering program. In this presentation, I focus on a couple of research ...
[Full version]

Quotient spaces are a natural mathematical tool to describe a variety of algorithmic problems in computer vision and related fields, where different objects are to be compared while their natural symmetries are to be ignored. One popular approach for working in quotient spaces is cancelling ...
[Full version]

You are invited to "Exposure to Industry Jobs Workshop - Putting in order Buzz Words" which aims to classify the jobs in the industry, interpret its concepts and products and illustrate a typical work day in the various roles it offers. The workshop will be ...
[Full version]

In a polynomial protocol a prover sends messages that are polynomials, and the verifier is allowed to check polynomial identities between these polynomials. The prover complexity is measured as the sum of degrees of the polynomials sent. The motivation for the definition is to capture ...
[Full version]

You are invited to a lecture and conversation with Itai Rosenblatt, scaleIO technical Team Leader and co-founder and VP of R&D at a new start-up, which will deal with the technical interview and the components of success and the initial impression it gives: • What ...
[Full version]

The complexity of Iterated Matrix Multiplication is a central theme in Computational Complexity theory, as the problem is closely related to the problem of separating various complexity classes within P. In this talk, we will talk about the complexity of computing an entry in the ...
[Full version]

CS 2020-21 orientation day for new students will be held online by zoom broadcast on Tuesday, October 20, 2020 at 10:30, and will include lectures by CS Dean, Vice Dean for Undergraduate Studies, CS Student Committee representatives and more, to be followed by A&Q sessions ...
[Full version]

You are all invited to the 2019 CS graduation ceremony of , which will be broadcast live on YouTube today, Thursday, October 15, 2020, at 18:30. Looking forward to seeing you!
[Full version]

The planted clique problem plays an important role in the field of average-case complexity. The problem consists of detecting graphs that contain a hidden clique of size $k$ that was planted in graphs from the Erdos-Renyi model $G_{n,0.5}$. The planted clique conjecture suggests that there ...
[Full version]

Reliability and time-efficiency are two key elements to consider in network design. Commonly, each is measured per service - availability probability of a specific service, the latency of a specific service, and overall - system average reliability and system average latency, considering the demand for ...
[Full version]

A statistical zero-knowledge proof for a problem Pi enables a computationally unbounded prover to convince a polynomial-time verifier that x belongs to Pi without revealing any additional information about x to the verifier, in a strong information-theoretic sense. Suppose, however, that the prover wishes to ...
[Full version]

In blockchain applications, transaction latency is a key factor in the quality of service (QoS). Each application that uses the blockchain network has the motivation to reduce the latency for its own transactions. The block proposer selects which pending transaction to include in the proposed ...
[Full version]

The fields of signal and image processing have been deeply influenced by the introduction of deep neural networks. These are successfully deployed in a wide range of real-world applications, obtaining state of the art results and surpassing well-known and well-established classical methods. Despite their impressive ...
[Full version]

A functional PIR array code is a coding scheme which encodes some s information bits into a tXm array such that every linear combination of the s information bits has k mutually disjoint recovering sets. Every recovering set consists of some of the array's columns ...
[Full version]

We tackle the task of Term Set Expansion (TSE): given a small seed set of example terms from a semantic class, finding more members of that class. The task is of great practical utility, and also of theoretical utility as it requires generalization from few ...
[Full version]

Shay Moran, Technion CS graduate, will give a lecture on his work in the theory of learning.
[Full version]

A new family of codes, called clustering-correcting codes, is presented in this paper. This family of codes is motivated by the special structure of the data that is stored in DNA-based storage systems. The data stored in these systems has the form of unordered sequences, ...
[Full version]

Machine learning has made considerable progress over the past decade, matching and even surpassing human performance on a varied set of narrow computational tasks. This progress has been enabled by the widespread availability of large datasets, as well as by improved algorithms and models. Distribution, ...
[Full version]

The Technion Ph.D. Students Graduation Ceremony 2020, will be held online TODAY, Wednesday evening, September 16, 2020, and will be broadcast on Facebook. This year, a substantial number of students - 231 Technion graduates in 2019-2020 - will receive their Ph.D. diplomas, among them 14 ...
[Full version]

The Hiroshi Fujiwara Cyber Security Research Center will hold the 8th Summer School on Cyber and Computer Security: "Privacy in Challenging Times". The event will take place on Monday-Thursday, September 7th-10th, 2020, broadcasted by Technion Zoom. Keynote Speakers: Ross Anderson, University of Cambridge, UK Ann ...
[Full version]

A proof of work (PoW) blockchain protocol distributes rewards to its participants, called miners, according to their share of the total computational power. Sufficiently large miners can perform selfish mining - deviate from the protocol to gain more than their fair share. Such systems are ...
[Full version]

You are invited to a lecture and conversation with Dr. Yonatan Yaniv, CS graduate and head of the research group at YOTPO, which will deal with the questions: Is it worth working during the degree? How to integrate into the industry, especially now in the ...
[Full version]

The Shapley value is a conventional and well-studied function for determining the contribution of a player to the coalition in a cooperative game. Among its applications in a plethora of domains, it has recently been proposed to use the Shapley value for quantifying the contribution ...
[Full version]

You are invited to participate in the Virtual Workshop on Machine Learning & Hardware Security that will be held August on Wednesday-Thursday, 26-27, 2020 @ Zoom. Organizers: Prof. Avi Mendelson, Technion, Israel Dr. Shivam Bhasin, NTU, Singapore For more Information, program and registration please visit ...
[Full version]

Scene Text Recognition (STR), the task of recognizing text against complex image backgrounds, is an active area of research. Current state-of-the-art (SOTA) methods still struggle to recognize text written in arbitrary shapes. In this paper, we introduce a novel architecture for STR, named Selective Context ...
[Full version]

Deduplication decreases the physical occupancy of files in a storage volume by removing duplicate copies of data chunks,but creates data-sharing dependencies that complicate standard storage management tasks. Specifically, data migration plans must consider the dependencies between files that are remapped to new volumes and files ...
[Full version]

We inspect the fine-grained complexity of answering queries over relational databases. With the ideal guarantees, linear time is required before the first answer to read the input and determine its existence, and then we need to print the answers one by one. Consequently, we wish ...
[Full version]

Optical character recognition (OCR) systems performance have improved significantly in the deep learning era. This is especially true for handwritten text recognition (HTR ), where each author has a unique style, unlike printed text, where the variation is smaller by design. That said, deep learning ...
[Full version]

King and Saia were the first to break the quadratic word complexity bound for Byzantine Agreement in synchronous systems against an adaptive adversary, and Algorand broke this bound with near-optimal resilience (first in the synchronous model and then with eventual-synchrony). Yet the question of asynchronous ...
[Full version]

Although Magnetic Resonance Imaging (MRI) is a superb medical imaging modality, its clinical use is limited by its long acquisition time. The acquisition time can be shortened by sampling data with a sub-Nyquist rate; however, this requires suitable methods for solving the ill-posed inverse problem ...
[Full version]

We report a series of robust empirical observations, whereby deep Neural Networks learn the examples in both the training and test sets in a similar order. This phenomenon is observed in all the commonly used benchmarks we evaluated, including many image classification benchmarks, and one ...
[Full version]

In this talk, I will describe a couple of results from my PhD thesis, that studies distributed algorithms for connectivity and distance related graph problems. I will focus on a recent line of work studying distance computation in the Congested Clique model of distributed computing. ...
[Full version]

One of the fascinating properties of deep learning is the ability of the network to reveal the underlying factors characterizing elements in datasets of different types. Autoencoders represent an effective approach for computing these factors and also have been studied in the context of their ...
[Full version]

Finding exact solutions to many fundamental optimization and distance computation problems is known to be a hard task in the distributed CONGEST model of computation. A natural relaxation then is to look for approximate solutions. In this talk, I will discuss some of the research ...
[Full version]

In the first part of this two-part talk, I will describe my work in adversarial machine learning (ML). Prior work has demonstrated that ML algorithms are vulnerable to evasion attacks at inference time by so-called adversarial examples. However, the implications of attacks in practice, under ...
[Full version]

In the directed minimum spanning tree problem (DMST, also called minimum weight arborescence), the network is given a root node r, and needs to construct a minimum-weight directed spanning tree, rooted at r and oriented outwards. In this paper we present the first sub-quadratic DMST ...
[Full version]

CS invites you to meet Flutter - a new Google application technology - via ZOOM, Wednesday, June 10, 19:00, with: Barak Menachem, Director of the Flutter Israel Developers Community Tamir Haim Rabia, React Native Expert, Flutter In the program: Cross-platform technologies What is Flutter and ...
[Full version]

CYBERDAY 2020 event, organized by Eli Biham, Sara Bitan, and the Technion Hiroshi Fujiwara Cyber Security Research Center, will be held in the cyber space (using Zoom - link will be sent towards the event upon registration), on Wednesday, June 10, 2020. In the program: ...
[Full version]

Automated tools and algorithms for synthesizing geometry have been ubiquitous in computer-aided design systems, since their very inception. Beyond the simple example of sketching tools for designers, algorithms for synthesizing geometry take many forms, such as design-by-constraints, optimization, and toolpath generation. In this thesis, we ...
[Full version]

CS invites graduate students to a meeting on the research career in the hi-tech industry: Is there research in the Israeli industry and what are the types of jobs and career paths available, to be discussed by a panel with: Lian Levin Eitan, Senior Manager ...
[Full version]

Computer system performance has improved due to creatively using more transistors (Moore’s Law) in parallel via bit-, instruction-, thread-, and data-level parallelism. With the slowing of technology scaling, a way to further improve computer system performance under energy constraints is to employ hardware accelerators. Each ...
[Full version]

Licklider and Taylor (1968) envisioned computational machinery that could enable better communication between humans than face-to-face. In the last fifty years, we have used computing to develop various means of communication, such as mails, messaging, video conversation, or virtual reality. These are, however, a proxy ...
[Full version]

Optimization in machine learning, both theoretical and applied, is presently dominated by first-order gradient methods such as stochastic gradient descent. Second-order optimization methods---that involve second-order derivatives and/or second-order statistics of the data---have become far less prevalent despite strong theoretical properties, due to their impractical computation, ...
[Full version]

The idea of light field technology is relatively old, however, apart from various attempts of construction of imaging devices which can densely capture scene radiance, only recent availability of devices from companies like Lytro and Raytrix started a significant increase of interest in the light ...
[Full version]

In this work, we present a method for node embedding in temporal graphs. We propose an algorithm that learns the evolution of a temporal graph's nodes and edges over time and incorporates this dynamics in a temporal node embedding framework for different graph prediction tasks. ...
[Full version]

Two-player turn-based zero-sum stochastic games is an interesting family of infinite duration games played on a finite set of states. These games may be seen as an extension of Markov Decisions Processes (MDPs) to a two-player setting. Such games have applications in various areas ranging ...
[Full version]

Hypernetworks, also known as dynamic networks, are neural networks in which the weights of at least some of the layers vary dynamically based on the input. Such networks have composite architectures in which one network predicts the weights of another network. I will briefly describe ...
[Full version]

The event will be held in live broadcast by ZOOM -  ID MEETING NO. 518018934 The 2020 open day invites outstanding undergraduates from all universities to come to the Technion and learn about the Computer Science and Department and register for Winter Semester 2020.     The ...
[Full version]

Voice assistants are designed to make our lives easier. By responding to spoken commands and questions, they provide a natural way of interaction with computers and smartphones. The problem starts when these voice assistants run by default even when the device is locked, which requires ...
[Full version]

Deep Learning has always been divided into two phases: Training and Inference. Deep networks are mostly used with large data-sets, both under supervised (Classification, Regression etc.) or unsupervised (Autoencoders, GANs) regimes. Such networks are only applicable to the type of data they were trained for, ...
[Full version]

Recently, there is an increase in delegating computations to powerful remote servers. This appearance raises questions of computational integrity and efficient verification. For instance, the server can be unreliable, therefore it may output erroneous results. In other contexts, where preserving information privacy is crucial, as ...
[Full version]

Contemporary presentation software provides sufficient tools for simple presentation scenarios. However, such tools have not changed for about two decades and are unsuitable for many complex modern needs. Content is typically limited to text and images only and cannot be expressed well in terms of ...
[Full version]

Contemporary presentation software provides sufficient tools for simple presentation scenarios. However, such tools have not changed for about two decades and are unsuitable for many complex modern needs. Content is typically limited to text and images only and cannot be expressed well in terms of ...
[Full version]

Online Portfolio Selection, aiming to optimize the allocation of wealth across a set of assets, is a fundamental research problem in computational finance and machine learning. Despite the theoretical challenges, the implementation of a real-world trading system is extremely challenging. This issue has been extensively ...
[Full version]

Applications such as distributed learning and edge computing strive to maximize the number of service requests (e.g., for data access) that can be concurrently executed by the system. Redundancy, in the form of simple replication and erasure coding, has emerged as an efficient and robust ...
[Full version]

Bluetooth is a widely deployed standard for wireless communications between mobile devices. It uses authenticated Elliptic Curve Diffie-Hellman for its key exchange. In this paper we show that the authentication provided by the Bluetooth pairing protocols is insufficient and does not provide the promised MitM ...
[Full version]

In this talk, we will discuss recent advances in multitask regression and their application to flood forecasting. We will begin with a brief overview of Google’s flood forecasting initiative in India. The project involves time series prediction in different geographical locations based on a limited ...
[Full version]

Magnetic Resonance Imaging (MRI) has long been considered to be among "the gold standards" of diagnostic medical imaging. The long acquisition times, however, render MRI prone to motion artifacts, let alone their adverse contribution to the relative high costs of MRI examination. Over the last ...
[Full version]

The manual detection, examination and repair of computer bugs are all notoriously difficult tasks that programmers face daily. Automated program repair receives a program with a bug, and outputs a set of changes to the program that would make it bug-free. We focus on formal ...
[Full version]

Medical ultrasound is a widespread imaging modality owing its popularity to cost efficiency, portability, speed, and lack of harmful ionizing radiation. In this work, we demonstrate that replacing the traditional ultrasound processing pipeline with a data-driven, learnable counterpart leads to significant improvement in image quality. ...
[Full version]

The recent and on-going Deep-Learning (DL) revolution, introduces a paradigm shift in almost all disciplines of signal processing. Traditionally, Computer Vision (CV) and Image Processing (IP) methods were based on hand-crafted feature extraction from the initial optical image, and then some hand-crafted classifier/filter was defined ...
[Full version]

We introduce a novel neural network-based partial differential equations solver for forward and inverse problems. The solver is grid free, mesh free and shape free, and the solution is approximated by a neural network. We employ an unsupervised approach such that the input to the ...
[Full version]

As data analytics becomes more crucial to digital systems, so grows the importance of characterizing the database queries that admit a more efficient evaluation. We consider the tractability yardstick of answer enumeration with a polylogarithmic delay after a linear-time preprocessing phase. Such an evaluation is ...
[Full version]

We are interested in the following question: How could one create a digital personal assistant, capable of acquiring and applying new skills through spoken interaction? The most rudimentary requirement of such skill acquisition would be Turing complete programming. Other such acquisitions might be the deduction ...
[Full version]

The recent push towards ultra-high (magnetic) fields in Magnetic Resonance Imaging (MRI) is expected to change the face of biomedical imaging. Recent studies employing state of the art 7 T MRI scanners achieved submillimeter resolution in 3D anatomical imaging of the human brain. However, the ...
[Full version]

We prove that for all constants a, NQP = NTIME[n^polylog(n)] cannot be (1/2 + 2^(-log^a n) )-approximated by 2^(log^a n)-size ACC^0 circuits. Previously, it was even open whether E^NP can be (1/2+1/sqrt(n))-approximated by AC^0[2] circuits. As a straightforward application, we obtain an infinitely often non-deterministic ...
[Full version]

Reconstructing observed images from fMRI brain recordings is challenging. Unfortunately, acquiring sufficient "labeled" pairs of {Image, fMRI} (i.e., images with their corresponding fMRI responses) to span the huge space of natural images is prohibitive for many reasons. We present a novel approach which, in addition ...
[Full version]

Suppose that in a given planar circular region, there are some smart mobile evaders and we would like to find them using swarms of sweeping agents. A smart evader is a target that detects and responds to the motions of searchers by performing evasive maneuvers, ...
[Full version]

In this talk I will review some major advances in the theory of distributed computing in the past decade and discuss key research challenges for the 2020s, with the main focus on distributed graph algorithms. I will present promising new approaches for doing research in ...
[Full version]

CS Labs: Systems and Software Development Laboratory (ICST), Cyber and Computer Security Laboratory (CYBER), The Laboratory for Computer Communication and Networking (LCCN), Geometric Image Processing Laboratory (GIP), invite you to visit the Spring Project Fair inProject Fair in IoT, Software, Android Apps, AI, Cyber, Computer ...
[Full version]

Least-mean squares (LMS) solvers such as Linear / Ridge / Lasso-Regression, SVD and Elastic-Net not only solve fundamental machine learning problems, but are also the building blo cks in a variety of other methods, such as decision trees and matrix factorizations. We suggest an algorithm ...
[Full version]

We propose a method to automatically match two shape collections with a similar shape space structure, e.g. two characters in similar poses, and compute the inter-maps between the collections. Given the intra-maps in each collection, we extract the corresponding shape difference operators, and use them ...
[Full version]

The task of synthetic data generation can be, roughly, stated as follows: A learner gets to observe examples, sampled from some unknown distributions, and needs to output "synthetic" examples that "look similar". For example, think of an algorithm that receives examples of music tunes from ...
[Full version]

We address the problem of binary code search in stripped executables (with no debug information). The main challenge is establishing binary code similarity even when the binary code has been compiled using different compilers, optimization levels and targeting diverse architectures. Moreover, the source code being ...
[Full version]

The study of permutations is motivated by their application in coding for flash memories, and their relevance in different applications of networking technologies and various channels. We study the multidimensional constrained systems of $\mathbb{Z}^d$-permutations with restricted movement. During the talk, we will show a correspondence ...
[Full version]

Modern machine learning algorithms have achieved remarkable performance in a myriad of applications, and are increasingly used to make impactful decisions in the hiring process, criminal sentencing, healthcare diagnostics and even to make new scientific discoveries. The use of data-driven algorithms in high-stakes applications is ...
[Full version]

Inmodern applications of graph algorithms, where the graphs of interest arelarge and dynamic, it is unrealistic to assume that an input representationcontains the full information of a graph being studied. For example, consider asocial network, where a vertex corresponds to a user and an edge ...
[Full version]

We are living in the era of massive data. Some estimate that more than 90% of the worlds data was generated in recent years. This large amount of data comes with technological challenges such as: distributed storage systems, synchronization issues, density constraints, power constraints and ...
[Full version]

We study the online problems related to controlling a linear time-invariant systems with noisy dynamics where either: (1) onlinevadversarially chosen quadratic losses and known dynamics, or (2) unknown dynamics but known quadratic losses. We present an efficient online learning algorithms for both setting with vanishing ...
[Full version]

Formal verification of infinite-state systems, and distributed systems in particular, is a long standing research goal. I will describe a series of works that develop a methodology for verifying distributed algorithms and systems using decidable logics, employing decomposition, abstraction, and user interaction. This methodology is ...
[Full version]

This talk presents new computational and statistical barriers in machine learning, along with the algorithmic developments that they inspire. The computational barriers arise in nonconvex optimization: we prove lower bounds on the (oracle) complexity of finding stationary points using (stochastic) gradient methods, showing that gradient ...
[Full version]

We propose a method for tracing the flowlines of a discrete tangent vector field on a triangle mesh. Our method makes use of functional vector fields, namely modeling of vector fields as operators acting on functions. In particular, we use the recently proposed adjoint representations ...
[Full version]

We propose a method for tracing the flowlines of a discrete tangent vector field on a triangle mesh. Our method makes use of functional vector fields, namely modeling of vector fields as operators acting on functions. In particular, we use the recently proposed adjoint representations ...
[Full version]

Compilers are designed today to use fixedAbstract -cost models that are based on heuristics to make different code optimizations. However, these models are unable to capture the data dependency, the computation graph, or the organization of instructions. Therefore, with these models compilers achieve suboptimal performance. ...
[Full version]

We develop differentially private mechanisms that achieve nearly instance-optimal losses, achieving lower loss than all appropriately unbiased mechanisms for any possible instance. We show that our mechanisms, with a modest increase in sample size (logarithmic or constant), are instance-optimal for a large family of functions. ...
[Full version]

One of the unique aspects of quantum mechanics is the no-cloning theorem. This theorem has direct applications in quantum crpytography: quantum money is very similar to the cash we use, but in addition, it is physically impossible to forge. In this talk, I will discuss ...
[Full version]

Dynamical systems are everywhere, from the flow of particles in the air to the evolution of people's personalities. Recently, the big data revolution has made increasing amounts of observations of such systems readily available. Unfortunately, in many practical scenarios, the governing equations of the dynamics ...
[Full version]

This talk presents a novel end-to-end approach to program repair based on sequence-to-sequence learning. We devise, implement, and evaluate a system, called SequenceR, for fixing bugs based on sequence-to-sequence learning on source code. This approach uses the copy mechanism to overcome the unlimited vocabulary problem ...
[Full version]

We consider the problem of training and evaluating generative models with a Generative Adversarial Network (GAN). Although GANs can accurately model complex distributions, they are known to be difficult to train due to instabilities caused by a difficult minimax optimization problem. In this work, we ...
[Full version]

Recent developments in Natural Language Processing (NLP) allow models to leverage large, unprecedented amounts of raw text, culminating in impressive performance gains in many of the field's long-standing challenges, such as machine translation, question answering, or information retrieval. In this talk, I will show that ...
[Full version]

The network line rate is constantly on the rise to support the exploding amounts of data. This means that we have less time to process individual packets, despite a growing demand for better network telemetry. Moreover, CPU speeds are not rising at the same rate ...
[Full version]