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

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

Deep Learning Models for Language: What they learn, where they fail, and how to make them more robust
יום שני, 31.12.2018, 10:30
Room 337 Taub Bld.
Deep learning has become pervasive in everyday life, powering language applications like Apple's Siri, Amazon's Alexa, and Google Translate. The inherent limitation of these deep learning systems, however, is that they often function as a ''black box'', preventing researchers and users from discerning the roles of different components and what they learn during the training process. In this talk, I will describe my research on interpreting deep learning models for language along th...

יום עיון בקריפטולוגיה 2018
יום שני, 31.12.2018, 09:00
אודיטוריום מכון המים, טכניון
יום העיון בקריפטולוגיה 2018, המאורגן בידי מרכז המחקר לאבטחת סייבר ע"ש הירושי פוג'יאוורה, יתקיים ביום שני, 31 בדצמבר 2018, בין השעות 16.20-9.00, באודיטוריום מכון המים, הטכניון. רוב ההרצאות יינתנו בעברית אך חלקן יינתנו באנגלית ובהפסקה תתקיים תצוגת...

Coding Theory: Covering Sets for Limited-Magnitude Errors
איגור שפרלינסקי (אונ' ניו סאות' ויילס)
יום ראשון, 30.12.2018, 14:30
טאוב 601
For a set M = {−µ, −µ + 1, . . . , λ} \ {0} with non-negative integers λ, µ < q not both 0, a subset S of the residue class ring Zq modulo an integer q ? 1 is called a (λ, µ; q)-covering set if MS = {ms mod q : m ∈ M, s ∈ S} = Zq . Small covering sets play an important role in codes correcting limited-magnitude errors. We use some number theoretic methods to give an explicit construction of a (λ, µ; q)-covering set S which is of the size ...

Certifiable Algorithms in Automated Verification
Shaull Almagor - CS-Lecture
יום חמישי, 27.12.2018, 10:30
Room 601 Taub Bld.
In formal verification, one uses mathematical tools in order to prove that a system satisfies a given specification. A limitation of traditional formal-verification algorithms and tools concerns the certification of positive results: while a verifier may answer that a system satisfies its specification, a designer often needs some palpable evidence, or certificate, of correctness. I will discuss the notion of certificates in several applications of formal verification, and present two wor...

Theory Seminar: Approximating Edit Distance Within Constant Factor in Truly Sub-Quadratic Time
אלעזר גולדברג (מכללה אקדמית ת"א-יפו)
יום רביעי, 26.12.2018, 12:30
טאוב 201
Edit distance is a measure of similarity of two strings based on the minimum number of character insertions, deletions, and substitutions required to transform one string into the other. The edit distance can be computed exactly using a dynamic programming algorithm that runs in quadratic time. Andoni, Krauthgamer and Onak (2010) gave a nearly linear time algorithm that approximates edit distance within approximation factor poly(log n). In this talk, I'll present a recent result in which w...

Pixel Club: Underwater Wide-Field Tomography of Sediment Resuspension
עדי וייניגר (הנדסת חשמל, טכניון)
יום שלישי, 25.12.2018, 11:30
חדר 337, בניין טאוב למדעי המחשב
Sediment resuspension is the transport of previously settled particles from the seafloor back into the overlying water. Measuring these abrupt and spatially varying events is challenging. Existing in-situ approaches are very localized. We presented a novel underwater wide field imaging system designed to (a) observe the seafloor and the water medium above it from a distance, (b) sense sediment resuspension events, and (c) algorithmically quantify the resuspension. Our technology quantifies the a...

Predicting a Better Future for Asynchronous SGD with DANA
עידו חכימי
יום שני, 24.12.2018, 11:00
טאוב 601
Distributed training can significantly reduce the training time of neural networks. Despite its potential, however, distributed training has not been widely adopted due to the difficulty of scaling the training process. Existing methods suffer from slow convergence and low final accuracy when scaling to large clusters, and often require substantial re-tuning of hyper-parameters. We propose DANA, a novel approach that scales to large clusters while maintaining similar final accuracy and converg...

Coding Theory: Constrained Code and Its Applications for Flash Memories.
וו ואן קו (סינגפור)
יום ראשון, 23.12.2018, 14:30
טאוב 601
Constrained codes have been studied actively for a long time with numerous applications in data recording and data communication systems. Recently, various types of one-dimensional and two-dimensional constrained codes have attracted significant attention owing to some applications for flash memories. ICI-free codes (Amit Berman and Yitzhak Birk - 2010), balanced q-ary ICI-free codes (Minghai Qin, Eitan Yaakobi and Paul Siegel - 2014), and weakly constrained codes(Sarit Buzaglo and Pa...

Towards Interpretable Deep Learning for Natural Language Processing
Roy Schwartz - CS-Lecture
יום חמישי, 20.12.2018, 10:30
Room 337 Taub Bld.
Despite their superb empirical performance, deep learning models for natural language processing (NLP) are often considered black boxes, as relatively little is known as to what accounts for their success. This lack of understanding turns model development into a slow and expensive trial-and-error process, which limits many researchers from developing state-of-the-art models. Customers of deep learning also suffer from this lack of understanding, because they are using tools that they can...

Theory Seminar: Almost Polynomial Hardness of Node-Disjoint Paths in Grids
ג'וליה צ'וזוי (TTIC)
יום רביעי, 19.12.2018, 12:30
טאוב 201
In the classical Node-Disjoint Paths (NDP) problem, we are given an n-vertex graph G, and a collection of pairs of its vertices, called demand pairs. The goal is to route as many of the demand pairs as possible, where to route a pair we need to select a path connecting it, so that all selected paths are disjoint in their vertices. The best current algorithm for NDP achieves an $O(\sqrt{n})$-approximation, while, until recently, the best negative result was a roughly $\Omega(\sqrt{\log n})$-h...

Pixel Club: Computational Optimal Transport for Data Sciences
גבריאל פיירה (CNRS)
יום שלישי, 18.12.2018, 11:30
חדר 337, בניין טאוב למדעי המחשב
Optimal transport (OT) has become a fundamental mathematical tool at the interface between calculus of variations, partial differential equations and probability. It took however much more time for this notion to become mainstream in numerical applications. This situation is in large part due to the high computational cost of the underlying optimization problems. There is a recent wave of activity on the use of OT-related methods in fields as diverse as computer vision, computer graphics, statis...

Coding Theory: New constructions of batch codes
איליה וורובייב (מוסקבה)
יום ראשון, 16.12.2018, 14:30
טאוב 601
A primitive k-batch code encodes a string x of length n into string y of length N, such that each multiset of k symbols from x has k mutually disjoint recovering sets from y. The definition of such codes is motivated by applications to load balancing in distributed storage and private information retrieval. We develop new constructions of linear primitive batch codes based on finite geometries. In some parameter regimes, our codes have lower redundancy than previously known batch codes. Also, w...

Towards the Next Generation of Proof Assistants: Enhancing the Proofs-as-Programs Paradigm
Liron Cohen - CS-Lecture
יום ראשון, 16.12.2018, 10:30
Room 701 Taub Bld.
As software has grown increasingly critical to our society's infrastructure, mechanically-verified software has grown increasingly important, feasible, and prevalent. Proof assistants have seen tremendous growth in recent years because of their success in the mechanical verification of high-value applications in many areas, including cyber security, cyber-physical systems, operating systems, compilers, and microkernels. These proof assistants are built on top of constructive type theory whose co...

Beyond SGD: Data Adaptive Methods for Machine Learning
Kfir Levy - CS-Lecture
יום חמישי, 13.12.2018, 10:30
Room 337 Taub Bld.
The tremendous success of the Machine Learning paradigm heavily relies on the development of powerful optimization methods. The canonical algorithm for training learning models is SGD (Stochastic Gradient Descent), yet this method has its limitations. It is often unable to exploit useful statistical/geometric structure, it might degrade upon encountering prevalent non-convex phenomena, and it is hard to parallelize. In this talk I will discuss an ongoing line of research where we develop ...

CSpecial Talk: Efficient Identification of Malicious Flows and Networks
רן בן-בשט (אונ' הרווארד)
יום רביעי, 12.12.2018, 13:30
טאוב 601
Distributed Denial of Service (DDoS) attacks are doubling in both number and volume on a yearly basis. These pose a critical threat to financial institutions and cloud providers that struggle to keep their services available and secure. To mitigate the attacks, operators rely on middleboxes that analyze the traffic and identify malicious flows and subnets. A key technique used for this identification is the Hierarchical Heavy Hitters (HHH) measurement, that singles out networks which send an ex...

Theory Seminar: Fairness through Computationally-Bounded Awareness
מיכאל קים (אונ' סטנפורד)
יום רביעי, 12.12.2018, 12:30
טאוב 201
As algorithmic prediction systems have become more widespread, so too have concerns that these systems may be discriminatory against groups of people protected by laws and ethics. We present a recent line of work that takes a complexity theoretic perspective towards combating discrimination in prediction systems. We'll focus on fair classification within the versatile framework of Dwork et al. [ITCS'12], which assumes the existence of a metric that measures similarity between pairs of individual...

VNF Latency Aware Placement in Multi-Access Edge Computing Environment
דור הריס
יום שלישי, 11.12.2018, 14:00
Taub 601
Multi-access Edge Computing (MEC) is a new network architecture that allows applications and network services to be executed at the edge of the network. This is done by running these services on commodity servers that are placed in close proximity to the network edge and to the cellular base stations in wireless networks. This architecture provides high bandwidth and low latency for network functions and other applications. However, the availability of the resources at the network edge is limi...

Pixel Club: Re-rendering Reality: Enhancing Vision and Hearing
טלי דקל (גוגל ואנו' קיימברידג')
יום שלישי, 11.12.2018, 11:30
חדר 1061, בניין מאייר, הפקולטה להנדסת חשמל
We all capture the world around us through digital data such as images, videos and sound. However, in many cases, we are interested in certain properties of the data that are either not available or difficult to perceive directly from the input signal. My goal is to “Re-render Reality”, i.e., develop algorithms that analyze digital signals and then create a new version of it that allows us to see and hear better. In this talk, I’ll present a variety of methodologies aimed at enhancing the ...

MMSE Approximation For Sparse Coding Algorithms Using Stochastic Resonance
דרור סימון
יום שני, 10.12.2018, 15:00
Taub 201
Sparse coding refers to the pursuit of the sparsest representation of a signal in a typically overcomplete dictionary. From a Bayesian perspective, sparse coding provides a Maximum a Posteriori (MAP) estimate of the unknown vector under a sparse prior. Various nonlinear algorithms are available to approximate the solution of such problems. In this work, we suggest enhancing the performance of sparse coding algorithms by a deliberate and controlled contamination of the input with random noise, a...

Coding Theory: Improved Decoding of Folded Reed-Solomon and Multiplicity Codes
מארי ווטרס (אונ' סטנפורד)
יום ראשון, 09.12.2018, 14:30
טאוב 601
List-decoding is an important primitive in the theory of error correcting codes, and it has long been a goal to obtain explicit constructions of capacity-achieving, efficiently list-decodable codes. Folded Reed-Solomon Codes (Guruswami-Rudra 2008) and Multiplicity codes (Guruswami-Wang 2011, Kopparty 2012) are two such constructions. However, previous analysis of these codes could not guarantee optimal parameters. In particular, the “list-size” of these codes was only shown to be polynomial,...

CGGC Seminar: A NURBS-based Multi-stage Approach for Shape Optimization of Mixing Elements in Single-screw Extruder
סבסטיאן אוסטרהולץ (אונ' אאכן)
יום רביעי, 05.12.2018, 13:30
טאוב 401
Today, extrusion is a one of the most important techniques for manufacturing continuous polymer profiles. Despite their widespread use, extruded products initially often suffer from both poor shape quality and material inhomogeneities due to inadequate process design. In an industrial environment, the elements of the extrusion line are therefore subject to extensive running-in trials. During these trials, both geometry and process conditions are iteratively adapted until the product attains the ...

Coding Theory: Load Balanced Fractional Repetition Codes
שאשוואט סילאס (אונ' סטנפורד)
יום ראשון, 02.12.2018, 14:30
טאוב 601
We introduce load-balanced fractional repetition (LBFR) codes, which are a strengthening of fractional repetition (FR) codes. LBFR codes have the additional property that multiple node failures can be sequentially repaired by downloading no more than one block from any other node. This allows for better use of the network, and can additionally reduce the number of disk reads necessary to repair multiple nodes. We characterize LBFR codes in terms of their adjacency graphs, and use this characteri...

Theory Seminar: The Power of Distributed Verifiers in Interactive Proofs
אילון יוגב (מדעי המחשב, טכניון)
יום רביעי, 28.11.2018, 12:30
טאוב 201
We explore the power of interactive proofs with a distributed verifier. In this setting, the verifier consists of $n$ nodes and a graph $G$ that defines their communication pattern. The prover is a single entity that communicates with all nodes by short message. The goal is to verify that the graph $G$ belongs to some language in a small number of rounds, and with small communication bound, \ie the proof size. This interactive model was introduced by Kol, Oshman and Saxena (PODC 2018...

ceClub: New Paradigms for Cryptographic Hashing
אילן קומרגודסקי (אונ' קורנל)
יום רביעי, 28.11.2018, 11:30
חדר 861, בניין מאייר, הפקולטה להנדסת חשמל
Cryptographic hash functions are the basis of many important and far reaching results in cryptography, complexity theory, and beyond. In particular, hash functions are the primary building block of fundamental applications like digital signatures and verifiable computation, and they are the tool underlying the proofs-of-work which drive blockchains. Because of the central role of cryptographic hash functions in both theory and practice, it is crucial to understand their security guarantees, towa...

Coding Theory: Coding over Sets for DNA Storage
אנדראס לנץ (אונ' מינכן)
יום ראשון, 25.11.2018, 14:30
טאוב 601
In this talk, we will present error-correcting codes for the storage of data in synthetic deoxyribonucleic acid (DNA). We investigate a storage model where a data set is represented by an unordered set of M sequences, where each sequence is a vector of length L over Z_q. Errors within that model are losses of whole sequences and point errors inside the sequences, such as insertions, deletions and substitutions. We derive lower bounds on the minimum redundancy that is needed to correc...

CGGC Seminar: Real-time Viscous Thin Films
אורסטיס ונטזוס וסער רז (מדעי המחשב, טכניון)
יום חמישי, 22.11.2018, 09:00
טאוב 401
We propose a novel discrete scheme for simulating viscous thin films at real-time frame rates. Our scheme is based on a new formulation of the gradient flow approach, that leads to a discretization based on local stencils that are easily computable on the GPU. Our approach has physical fidelity, as the total mass is guaranteed to be preserved, an appropriate discrete energy is controlled, and the film height is guaranteed to be non-negative at all times. In addition, and unlike all existing meth...

CSpecial Talk: Constructing a Trapped Ion Quantum Computer
ווילפריד הנסינגר (מרכז סאסקס לטכנולוגיות קואנטום)
יום רביעי, 21.11.2018, 15:00
טאוב 601
Quantum computers may be able to solve certain problems that are so complicated that even the fastest supercomputer would take millions of years to provide an answer. Entanglement and superposition are quantum phenomena which can be tamed in order to build such a machine. Optimising financial transactions, machine learning, creating new medicines, understanding protein folding and breaking codes are just some of the problems where the existence of a quantum computer could change everything. ...

Theory Seminar: Colouring Directed Hamilton Cycles Online
ג'וזף בריגס (מתמטיקה, טכניון)
יום רביעי, 21.11.2018, 12:30
טאוב 201
Consider a directed analogue of the random graph process on $n$ vertices, whereby the $n^2-n$ directed edges are ordered uniformly at random and revealed one at a time, giving a nested sequence of directed graphs $D_0,D_1,\dots,D_m, \dots$. In this setting, one may ask about events that hold with probability $1-o(1)$ (whp) as $n$ tends to infinity. In particular, for a fixed $q=O(1)$, we wish to study the hitting time for the emergence of $q$ edge-disjoint directed Hamilton cycles. This is th...

ceClub: Vulnerability, Security and Privacy at the Edge of Computing
יום רביעי, 21.11.2018, 11:30
חדר 861, בניין מאייר, הפקולטה להנדסת חשמל
The steady rise of intelligence and autonomy over a scale of distributed, connected and smart components is heralding the era of Internet-of-Intelligence. Without adequate safeguards in place, such components can lead to terrible consequences. In this talk, I will discuss three aspects - namely, vulnerability, security and privacy of such edge–computing scenarios. The vulnerability aspect will show how a simple setup can derail sophisticated unmanned aerial vehicles. The security angle will be...

איך תהפכו תואר לקריירה? הזמנה לסדנת חיפוש עבודה
יונתן יניב (YOTPO)
יום שלישי, 20.11.2018, 18:30
חדר 337, בניין טאוב למדעי המחשב
אנו שמחים להזמין אתכם למפגש ראשון בסדרת מפגשים בנושא קריירה וחיפוש עבודה, שייערכו בפקולטה.   איך הופכים תואר לקריירה?  ד"ר יונתן יניב, בוגר הפקולטה, חוקר אלגוריתמים ומערכות לומדות בחברת YOTPO –  בשיחה על: -  בחירות והחלטות על קורסים ופרוי...

Pixel Club: Understanding Scene Semantics from Vehicles
עידן גלר וקובי בנטולילה (מובילאיי)
יום שלישי, 20.11.2018, 11:30
חדר 337, בניין טאוב למדעי המחשב
Going from driving assistance to autonomous driving, requires a deeper understanding of the surroundings of the vehicle. Driving assistance systems provide technological solutions that help with the driving process, while these systems usually provide multiple features that enhance driving safety (such as automate lighting, adaptive cruise control, collision avoidance, etc.), they are still very simplistic with respect to their level of scene understanding. Autonomous driving, raises much more c...

CSpecial Talk: Neuro-Symbolic Program Synthesis
אלכס פולוזוב (מיקרוסופט)
יום שני, 19.11.2018, 12:00
חדר 337, בניין טאוב למדעי המחשב
Program synthesis, the task of automatically finding a program that satisfies a given user intent specification, has been successfully applied to aid commercial data wrangling, software engineering, and question answering. While data-driven (deep learning) and symbolic (formal logic) techniques are both commonly used for program synthesis, both of them have their strengths and weaknesses. Symbolic techniques guarantee correctness of the generated program with respect to the specification, bu...

Coding Theory: Spatially-Coupled LDPC Codes With Random Access
אשד רם (טכניון)
יום ראשון, 18.11.2018, 14:30
טאוב 601
One of the most promising error correcting schemes is the family of Spatially-Coupled (SC) LDPC codes. SC-LDPC codes achieve capacity universally on memoryless binary symmetric channels, and their special structure can be exploited to implement low-latency high-throughput decoders. In this talk, a new type of SC-DPC codes motivated by practical storage applications is presented. These new codes can be decoded locally at the level of sub-blocks that are much smaller than the full code block, thus...

Theory Seminar: Bounded Independence Plus Noise and its Applications to Coding Theory and Pseudorandomness
צ'ין הו לי (אונ' נורת'ווסטרן)
יום רביעי, 14.11.2018, 12:30
טאוב 201
We show that bounded independent distributions under perturbation of noise fool product tests, which are products of bounded functions defined on disjoint inputs. These results have found applications in coding theory and pseudorandomness. In this talk, I will talk about communication and space lower bounds for decoding linear codes, and how to construct pseudorandom generators for product tests and space-bounded computation. Based on joint works with Elad Haramaty and Emanuele Viol...

ceClub: Smart Distributed Storage for the Datacenter
זולט איסטבן (IMDEA, מדריד, ספרד)
יום רביעי, 14.11.2018, 11:30
חדר 1061, בניין מאייר, הפקולטה להנדסת חשמל
There is a widening gap in the datacenter between data growth and stagnating CPU performance. This gap limits our ability to solve more complex problems and prompts us to revisit both the architecture of servers and the ways we manage and process data. In my work, I aim to narrow this gap using specialization and HW/SW co-design. As a specific example, I will talk about building energy-efficient distributed storage for large-scale data processing applications. Most modern data-intensiv...

COLLOQUIUM LECTURE - Facing Old New Frontiers in Visual Object Recognition Using Deep Learning
Daphna Weinshall
יום שלישי, 13.11.2018, 14:30
Room 337 Taub Bld.
The emergence of very effective deep learning techniques in recent years has affected almost all areas of research remotely related to AI, and computer vision in particular has been changed irreversibly. In this talk I will focus on visual object recognitions. The incredible recent progress in this area, and the availability of very effective public domain tools for object recognition in images, allows us to reopen old questions and approach them from new directions with new tools. I will t...

FORESHADOW: Extracting the Keys to the Intel SGX Kingdom with Transient Out-of-Order Execution
מרינה מינקין
יום ראשון, 11.11.2018, 17:30
Electrical Eng. Building 1061
Trusted execution environments, and particularly the Software Guard eXtensions (SGX) included in recent Intel x86 processors, gained significant traction in recent years. A long track of research papers, and increasingly also real-world industry applications, take advantage of the strong hardware-enforced confidentiality and integrity guarantees provided by Intel SGX. Ultimately, enclaved execution holds the compelling potential of securely offloading sensitive computations to untrusted remote p...

Coding Theory: Functional PIR and Batch Codes
ייווי זאנג (מדעי המחשב, טכניון)
יום ראשון, 11.11.2018, 14:30
טאוב 601
Codes with locality and/or availability have been extensively studied in recent years, including locally repairable codes (LRC), PIR codes, batch codes, etc. Usually in such a code of dimension s, we focus on the recovering sets only for the s information symbols. We propose a natural generalization of PIR and batch codes, named functional PIR codes and functional batch codes, by analyzing the recovering sets for arbitrary vectors of length s. In this talk we present some bounds and constructio...

LOFT: Lock-Free Transactional Data Structures
אבנר אליזרוב
יום ראשון, 11.11.2018, 11:00
Taub 601
Concurrent data structures are widely used in modern multi-core architectures, providing atomicity (linearizability) for each concurrent operation. However, it is often desirable to execute several operations on multiple data structures atomically. We present a design of a transactional framework supporting linearizable transactions of multiple operations on multiple data structures in a lock-free manner. Our design uses a helping mechanism to obtain lock-freedom, and an advanced lock-free conte...

Theory Seminar: Lossless Dimension Expanders via Linearized Polynomials and Subspace Designs
ניקולאס רש (אונ' קרנגי מלון)
יום רביעי, 07.11.2018, 12:30
טאוב 201
or a vector space F^n over a field F, an (η, ß)-dimension expander of degree d is a collection of d linear maps Γ_j : F^n \to F^n such that for every subspace U of F^n of dimension at most ηn, the image of U under all the maps, ∑_{j=1}^d Γ_j(U), has dimension at least ßdim(U). Over a finite field, a random collection of d=O(1) maps Γ_j over excellent “lossless” expansion with high probability: ß ≈ d for η ≥ Ω(1/\eta). When it comes to a family of explicit constructions (for g...

Indoor Positioning of a Robotic Vehicle Using a Single Camera and a Floorplan
ג'ון נונאן
יום שלישי, 06.11.2018, 15:00
Taub 601
Global localization for robotic vehicles is an essential backbone for robust autonomous navigation. While GPS systems offer effective solutions in outdoor environments, they are inadequate for providing positioning in indoor settings. In order to solve this problem, we investigate a special vision-based approach. Vision systems are particularly advantageous due to the amount of information they supply about the scene. To offer a system which has low cost and fast setup, we utilize a monocula...

COLLOQUIUM LECTURE - Learning-Driven Network Protocols
Michael Schapira
יום שלישי, 06.11.2018, 14:30
Room 337 Taub Bld.
Machine learning (ML) has deeply impacted many areas of computer science, including computer vision, natural language processing, computational biology, and beyond. Yet, computer networking has largely withstood the ML tide until recently. Recent advances suggest that this might be changing. We ask whether/when traditional network protocol design, which traditionally relies on the application of algorithmic insights by human experts, can be replaced by a data-driven, ML-guided approach. W...

Pixel Club: Multicolor Localization Microscopy by Deep Learning
ערן הרשקו (הנדסת חשמל, טכניון)
יום שלישי, 06.11.2018, 11:30
חדר 337, בניין טאוב למדעי המחשב
Deep learning has become an extremely effective tool for image classification and image restoration problems. Here, we apply deep learning to microscopy, and demonstrate how neural networks can exploit the chromatic dependence of the point-spread function to classify the colors of single emitters imaged on a grayscale camera. While existing single-molecule methods for spectral classification require additional optical elements in the emission path, e.g. spectral filters, prisms, or phase masks, ...

Coding Theory: On the List-decodability of Random Linear Rank-metric Codes
ניקולאס רש (אונ' קרנגי מלון)
יום ראשון, 04.11.2018, 14:30
טאוב 601
At its core, coding theory studies how many elements of a (finite) vector space one can pack subject to the constraint that the elements are well-spread. Typically, the notion of closeness is that of Hamming distance, that is, the distance between two vectors is the number of coordinates on which they differ. In a rank-metric code, codewords are matrices over a finite field and the distance between codewords is the rank of their difference. A linear rank-metric code is a subspace of matrices (ov...

CGGC Seminar: Tangent Estimation of 3D Digital Curves
קספר פלוטה (מדעי המחשב, טכניון)
יום ראשון, 04.11.2018, 13:30
חדר 337, בניין טאוב למדעי המחשב
In this talk I will discuss a new tangent estimator for 3D digital curves. The proposed estimator is based on 3D digital line recognition, and it is an extension of a similar 2D tangent estimator proposed for tangent estimating along digital contours. The main advantages of this new tangent estimator are its speed and its asymptotic convergence – the estimated tangents converge to the ground truth as the resolution increases. ...

Theory Seminar: Random Binary Search Trees with Concurrent Insertions
גיאורג ג'יאקופיס (INRIA)
יום רביעי, 31.10.2018, 12:30
טאוב 201
We consider the following simple random experiment to determine the impact of concurrency on the performance of binary search trees: n randomly permuted keys arrive one at a time. When a new key arrives, it is first placed into a buffer of size c. Whenever the buffer is full, or when all keys have arrived, an adversary chooses one key from the buffer and inserts it into the binary search tree. The ability of the adversary to choose the next key to insert among c buffered keys, models a distribut...

Coding Theory: Codes, Computation, and Privacy
נתנאל רביב (California Institute of Technology)
יום ראשון, 28.10.2018, 14:30
טאוב 601
Data intensive tasks have been ubiquitous ever since the data science revolution. The immensity of contemporary datasets no longer allows computations to be done on a single machine, and distributed computations are inevitable. Since most users cannot afford to maintain a network of commodity servers, burdensome computations are often outsourced to third party cloud services. However, this approach opens a Pandora's box of potential woes, such as malicious intervention in computations, privacy i...

Exploring the signal manifold of super-imposed pulses
צ'רלס סוטון
יום חמישי, 25.10.2018, 14:00
Taub 401
Large points cloud X in $R^{n\times D}$ are often assumed to be sampled from a k-dimensional manifold where $k 1$). However, there is no evidence that this technique extends to other manifolds. This work aims to verify how the multi-scale singular value analysis of a man...

Theory Seminar: Exploring Crypto Dark Matter: New Simple PRF Candidates and Their Applications
דייוויד וו (אונ' סטנפורד)
יום רביעי, 24.10.2018, 12:30
טאוב 201
Pseudorandom functions (PRFs) are one of the fundamental building blocks in cryptography. Traditionally, there have been two main approaches for PRF design: the "practitioner's approach" of building concretely-efficient constructions based on known heuristics and prior experience, and the "theoretician's approach" of proposing constructions and reducing their security to a previously-studied hardness assumption. While both approaches have their merits, the resulting PRF candidates vary greatly i...

Pixel Club: Ultrasound Imaging with Deep Neural Networks
אורטל סנוף (מדעי המחשב, טכניון)
יום שלישי, 23.10.2018, 11:30
חדר 337, בניין טאוב למדעי המחשב
Medical ultrasound (US) is a widespread imaging modality owing its popularity to cost efficiency, portability, speed, and lack of harmful ionizing radiation. At the same time, there are trade-offs among different US imaging qualities such as frame-rate, resolution, signal-to-noise-ratio and contrast. So far, these trade-offs have been compensated by mostly traditional model-based signal-processing methods. In the wake of the recent revival of artificial neural networks (NN), or more specifically...

TCE Guest Lecture: Future of Computing – Domain Specific Accelerators
ויליאם ג'. דאלי (אונ' סטנפורד)
יום רביעי, 17.10.2018, 14:30
חדר 280, בניין מאייר, הפקולטה להנדסת חשמל
Scaling of computing performance enables new applications and greater value from computing. With the end of Moore’s Law and Dennard Scaling, continued performance scaling will be due primarily to specialization. Graphics processing units are an ideal platform on which to build domain-specific accelerators. They provide very efficient, high performance communication and memory subsystems - which are needed by all domains. Specialization is provided via “cores”, such as tensor cores or ray-t...

Pixel Club: A Local Block Coordinate Descent Algorithm for the Convolutional Sparse Coding Model
אב זיסלמן (מדעי המחשב, טכניון)
יום שלישי, 16.10.2018, 11:00
טאוב 401
The Convolutional Sparse Coding (CSC) model has recently gained considerable traction in the signal and image processing communities. By providing a global, yet tractable, model that operates on the whole image, the CSC was shown to overcome several limitations of the patch-based sparse model while achieving superior performance in various applications. Contemporary methods for learning the CSC dictionary often rely on the Alternating Direction Method of Multipliers (ADMM) in the Fourier domain ...

Label Expansion - Integrating Prior Knowledge to Large Label Set Tasks
דור זהר
יום חמישי, 11.10.2018, 14:30
Taub 301
In many Natural Language Processing classification tasks, the label space consists of the entire vocabulary, and therefore might have hundreds of thousands of labels. Important tasks such as language modeling, machine translation and dialog systems all have vocabulary label sets. Due to Zipf's law, a large number of words in the vocabulary will have only a few appearances in the corpus, hindering the ability to learn proper representations for these words. This work utilizes a prior hierarchical...

Pixel Club: Approximation Algorithms for Aligning Points to Lines with Applications to Visual Tracking
איברהים ג'ובראן (אונ' חיפה)
יום שני, 08.10.2018, 11:00
טאוב 401
We consider the pose-estimation problem of aligning (rotating and translating) a set of n points to a corresponding set of n lines, both on the plane. The goal is to minimize the sum of distances between the matched point-line pairs over all possible translations, rotations, and matching functions. These natural problems occur e.g. in localization of GPS data (aligning points to a map), 2D images (object to RGB pixels) or stars (to sky patterns, e.g. by drone), with applications for mob...

בית-ספר קיץ השביעי בנושא אבטחת סייבר
יום שלישי, 02.10.2018, 09:30
טכניון
מרכז המחקר לאבטחת סייבר ע"ש הירושי פוג'יווארה יקיים את בית-ספר קיץ השביעי על אבטחת סייבר ומחשבים: "Trusted Execution and Hardware Side Channels" הכנס יתקיים בימים ג'-ה', 4-2 באוקטובר, 2018, בטכניון, חיפה. מארגני הכנס: פרופ' מרק זילברשטיין  – טכניון פרופ...

Trivariate volumes - Algorithms and Applications
פאדי מצארווי
יום ראשון, 16.09.2018, 13:30
Taub 337
This work investigates algorithms and data structures for volumetric representation (V-reps) of 3D objects, representing the interior of the object in addition to its boundaries, extending the contemporary Boundary representation (B-rep) common scheme. In recent years, there is a growing and emerging need for a volumetric representation of 3D objects. Specifically, with the development of Iso-geometric Analysis (IGA) and advanced manufacturing technologies employing heterogeneous materials, su...

CGGC Seminar: Improving the Upper Bound on the Number of Polycubes
מירא שלח (אונ' סטנפורד)
יום רביעי, 12.09.2018, 13:30
טאוב 401
A d-dimensional polycube is a facet-connected set of cells (cubes) on the d-dimensional cubical lattice. Let Ad(n) denote the number of d-dimensional polycubes (distinct up to translations) with n cubes, and λd denote the limit of the ratio Ad(n+1)/Ad(n) as n approaches infinity. The exact value of λd is still unknown rigorously for d ≥ 2; the asymptotics of λd, as d approaches infinity, also remained elusive as of today. In this talk, I will show how we revisit and extend the a...

CGGC Seminar: From Geometry to Simulation and Back: Numerical Design in Primary Manufacturing Processes
סטפני אלגטי (אונ' אאכן)
יום רביעי, 05.09.2018, 13:30
חדר 337, בניין טאוב למדעי המחשב
Using a mold or die, primary shaping manufacturing processes form material from an initially unshaped state (usually melt) into a desired shape. Examples of such a process are extrusion or high-pressure die casting — processes that are responsible for many products of our everyday life, from pipes to yoghurt cups. From the design perspective, what these processes have in common is that the exact design of the mold cannot be determined directly and intuitively from the product shape. This is d...

Characterization of Cellular Metabolism throughout the Cell Cycle in Cancer: An Integrated Experimental-Computational Approach
אויניונג אן
יום שלישי, 04.09.2018, 14:00
Taub 601
Cellular metabolic demands change throughout the cell cycle. Nevertheless, a characterization of how metabolic fluxes adapt to the changing demands throughout the cell cycle is lacking. The rate of metabolic reactions and pathways in living cells, also referred to as metabolic flux, is not a directly measurable quantity. The most direct approach for quantifying intracellular metabolic flux is isotope tracing coupled with computational metabolic flux analysis. This has become a central technique ...

Trusted Execution Environments
אסף רוזנבאום
יום רביעי, 29.08.2018, 10:00
Taub 601
As the cyber security threat continues to grow, we need to better defend our systems. One of the ways to improve the security of a computer system is to isolate its critical assets from the main execution environment. These critical assets are handled in a Trusted Execution Environment, which can protect them even when the main execution environment is compromised. One of the leading technologies enabling trusted execution environment is ARM TrustZone. In this talk we'll present our research o...

Pixel Club: A Deep Learning Approach for Generic Image Segmentation
אורן שייר (הנדסת חשמל, טכניון)
יום ראשון, 19.08.2018, 10:30
חדר 1061, בניין מאייר, הפקולטה להנדסת חשמל
Recent advances in deep learning and convolutional neural networks (CNNs) have had a profound impact on almost every computer vision task. However, generic (non-semantic) image segmentation is a notable exception despite it being one of the most fundamental and widely studied tasks in this field. In this talk, we revisit the generic segmentation task and propose Deep Generic Segmentation (DGS) -- a new deep learning approach combined with conditional random fields (CRFs). Our method differs sign...

CGGC Seminar: Automatic View Placement in 3D toward Hierarchical Non-linear Presentations
דניאל רודין (מדעי המחשב, טכניון)
יום ראשון, 05.08.2018, 13:30
חדר 337, בניין טאוב למדעי המחשב
Moving from the concept of discrete sequences of 2D slides towards smooth 3D multimodal hierarchical presentations promises many improvements in quality and effectiveness of presentations. On the other hand, such a move poses many difficulties, one of which is how to arrange content in a 3D space. This task becomes further complicated when the story-graph of the presentation is evolving and is more complex than a single linear story-path. In this work, we propose a framework for automatically so...

Hardware Security Seminar: Discovered@Technion -- Breaking the Bluetooth Pairing
ליאור נוימן (מדעי המחשב, טכניון)
יום ראשון, 29.07.2018, 09:30
טאוב 601
Bluetooth is a widely deployed platform for wireless communications between mobile devices. It uses authenticated Elliptic Curve Diffie-Hellman for its key exchange. We show that the authentication provided by the Bluetooth pairing protocols is insufficient and does not provide the promised MitM protection. We present a new variant of an Invalid Curve Attack that preserves the x-coordinate of the public keys. The attack compromises the encryption keys of all of the current Bluetooth authenticate...

Prototype-Based Drug Discovery using Conditional Diversity Networks
שחר הראל
יום ראשון, 22.07.2018, 13:30
Taub 301
Designing a new drug is an expensive and lengthy process. The first stage is drug discovery, in which potential drugs are identified before selecting a candidate drug to progress to clinical trials. As the space of potential molecules is very large (10^23-10^60), a common technique during drug discovery is to start from a molecule which already has some of the desired properties. An interdisciplinary team of scientists generates hypothesis about the required changes to the prototype. We call thi...

Multi-Task Learning for Text Processing on the Web
רבקה מלכה
יום חמישי, 19.07.2018, 15:00
Taub 601
Text processing on the web is challenging due to the use of informal and ungrammatical language. Yet, this is a very prominent domain for Natural Language Processing, due to the growing volume of textual information that is communicated through Internet pages and social media platforms. In this thesis we describe a particular form of text processing on the web - syntactic parsing of web queries. We present two novel contributions: (1) We extend the transition system of a state-of-the-art transi...

Metabolic Modeling for Bioengineering
אדוארד ויטקין
יום ראשון, 01.07.2018, 14:30
Taub 601
Efficient and sustainable conversion of biomass into valuable products is a major challenge for bioengineering. The composition of the feedstock biomass and the ability of microorganisms to efficiently ferment it are two most critical factors influencing the process efficiency. Intelligent design that addresses both these factors can greatly benefit from organism metabolic models and from using them in simulations and in computer-assisted optimization of the fermentation processes. In this ...

Theory Seminar: An Equivalence Between Attribute-Based Signatures and Homomorphic Signatures, and New Constructions for Both
רותם צברי (מכון ויצמן למדע)
יום רביעי, 27.06.2018, 12:30
טאוב 201
In Attribute-Based Signatures an authority can generate multiple signing keys, where each key is associated with a constraint f. A key respective to f can sign a message x only if f(x)=0. The security requirements are unforgeability and key privacy (signatures should not expose the specific signing key used). In Homomorphic Signatures, given a signature for a data-set x, one can evaluate a signature for the pair (f(x),f), for functions f. In context-hiding HS, evaluated signatures do not reveal ...

Real-time Learning using Core-Sets: Autonomous Drones for Rami Levy
Dan Feldman - COLLOQUIUM LECTURE
יום שלישי, 26.06.2018, 14:30
Room 337 Taub Bld.
A coreset (or core-set) of a dataset is its semantic compression with respect to a set of classifiers, such that learning the (small) coreset provably yields an approximate classifier of the original (full) dataset. Composable coresets also allow handling streaming and distributed data, e.g. using a cloud or swarm of drones. In this talk I will forge a link between coresets for fundamentals problems in machine (active and deep) learning -- to problems in real-time robotics. Finally, we ...

היום! יריד הפרוייקטים השנתי במדעי המחשב
יום שלישי, 26.06.2018, 13:00
כניסת הקומה וקומה 1 - בניין טאוב למדעי המחשב
מעבדות הפקולטה למדעי המחשב מזמינות אתכם לבקר ביריד הפרוייקטים השנתי שיתקיים ביום שלישי, 26 ביוני 2018, החל מ-13:00 בקומת הכניסה ובקומה 1 של בניין טאוב למדעי המחשב. פרטים נוספים בכרזה המצורפת. כולם מוזמנים!...

Properties of Minimal-Perimeter Polyominoes
גיל בן-שחר
יום שלישי, 26.06.2018, 10:30
Taub 601
A polyomino is an edge-connected set of cells on the square lattice. The problem of counting poyominoes dates back to the 1950s when it was studied in parallel in the fields of combinatorics and statistical physics. The study of polyominoes usually classifies polyominoes by their area, which is the number of cells the polyomino contains. Less explored is the perimeter of a polyomino, which is the set of empty cells adjacent to the polyomino. Several works studied the relation between the area...

New Lower Bounds for Communication Models under Bandwidth Restrictions
סרי חורי
יום שני, 25.06.2018, 13:30
Taub 601
In this talk I will sketch two lower bound techniques for distributed models under bandwidth restrictions. The first is via reductions from the two party communication model, which is a well known technique for achieving lower bounds in distributed computing. I will show a new gadget for this framework that allows us to prove stronger lower bounds. As an example for this gadget, I will present a new lower bound for computing the exact or approximate diameter. The second technique is called th...

CGGC Seminar: An Explicit Structure-preserving Numerical Scheme for EPDiff
אורסטיס ונטזוס (מתמטיקה, טכניון)
יום ראשון, 24.06.2018, 13:30
טאוב 401
We present a new structure-preserving numerical scheme for solving the Euler–Poincaré Differential (EPDiff) equation on arbitrary triangle meshes. Unlike existing techniques, our method solves the difficult non-linear EPDiff equation by constructing energy preserving, yet fully explicit, update rules. Our approach uses standard differential operators on triangle meshes, allowing for a simple and efficient implementation. ...

Hardware Security Seminar: Intel SGX keys Management and Trusted Computing Base (TCB) Recovery
איליה אלכסנדרוביץ (אינטל)
יום ראשון, 24.06.2018, 09:30
טאוב 601
Bugs, possibly leading to security flaws, are inevitable in the extremely complex modern processors. Some of such bugs may be later fixed in the field by patching processor firmware. In this presentation we will review mechanisms provided by the Intel Software Guard Extensions (SGX) architecture to recover from security vulnerabilities and to re-establish trust in the recovered platform. Bio: Ilya Alexandrovich is a Principal Engineer in the Intel Core Architecture Group...

Theory Seminar: On Distributional Collision Resistant Hashing
אילון יוגב (מכון ויצמן למדע)
יום רביעי, 20.06.2018, 12:30
טאוב 201
Collision resistant hashing is a fundamental concept that is the basis for many of the important cryptographic primitives and protocols. Collision resistant hashing is a family of compressing functions such that no efficient adversary can find {\em any} collision given a random function in the family. In this work we study a relaxation of collision resistance called \emph{distributional} collision resistance, introduced by Dubrov and Ishai (STOC '06). This relaxation of collision ...

Novel Image and Video Super-Resolution Relying on Denoising Algorithms
אלון בריפמן
יום שלישי, 19.06.2018, 11:00
Taub 601
Single Image Super-Resolution (SISR) aims to recover a high-resolution image from a given low resolution version of it (the given image is assumed to be a blurred, down- sampled and noisy version of the original image). Video Super Resolution (VSR) targets series of given images, aiming to fuse them to create a higher resolution outcome. Although SISR and VSR seem to have a lot in common, as only the input domain changes between the two, most SISR algorithms do not have a simple extension to VSR...

היום! יום מחקר 2018 בפקולטה למדעי המחשב
יום שני, 18.06.2018, 15:00
כניסת הקומה - בניין טאוב למדעי המחשב
יום המחקר השמיני לתארים מתקדמים בפקולטה למדעי המחשב יתקיים ביום ראשון, 18 ביוני, 2018, בין השעות 15:00-17:00, בלובי של בניין טאוב למדעי המחשב. יום מחקר הוא הזדמנות עבור משתלמי הפקולטה להציג את מחקריהם באמצעות פוסטרים ומצגות בפני אנשי סגל ומנה...

CGGC Seminar: Multi-chart Generative Surface Modeling
חלי בן-חמו (מכון ויצמן למדע)
יום ראשון, 17.06.2018, 13:30
חדר 337, בניין טאוב למדעי המחשב
We introduce a 3D shape generative model based on deep neural networks. A new image-like (i.e., tensor) data representation for genus-zero 3D shapes is devised. It is based on the observation that complicated shapes can be well represented by multiple parameterizations (charts), each focusing on a different part of the shape. The new tensor data representation is used as input to Generative Adversarial Networks for the task of 3D shape generation. The 3D shape tensor representation ...

הכנס השנתי הבינלאומי השמיני להנדסת מחשבים בטכניון בנושא למידה עמוקה: תיאוריה ומעשה
יום חמישי, 14.06.2018, 08:30
חדר 280, בניין מאייר, הפקולטה להנדסת חשמל
הכנס השנתי הבינלאומי השמיני להנדסת מחשבים בטכניון בנושא הנדסת מחשבים בטכניון בנושא למידה עמוקה: תיאוריה ומעשה יתקיים בימים חמישי, 14 ביוני, 2018 בחדר 280, בניין מאייר, הפקולטה להנדסת חשמל, הטכניון. מארגני הכנס הם דניאל סודרי מ...

Theory Seminar: Deterministic Meeting in Networks
Andrzej Pelc (Université du Québec en Outaouais, Canada)
יום רביעי, 13.06.2018, 12:30
טאוב 201
The task of rendezvous (also called gathering) calls for a meeting of two or more mobile entities, starting from different positions in some environment. Those entities are called mobile agents or robots, and the environment can be a network modelled as a graph or a terrain in the plane, possibly with obstacles. The rendezvous problem has been studied in many different scenarios. Two among many adopted assumptions particularly influence the methodology to be used to accomplish rende...

ceClub: Making Triangle Counting Fast - Introducing Logarithmic Radix Binning & Vectorized Tri-Counting
עודד גרין (מכון טכנולוגי, גיאורגיה)
יום רביעי, 13.06.2018, 11:30
חדר 861, בניין מאייר, הפקולטה להנדסת חשמל
Triangle counting is a scalable analytic that benefits from a large number of processors. Similar to many other graph analytics, the control flow for each thread of triangle counting algorithms is determined by the input graph. This data dependency makes both load-balancing and compiler optimization much more challenging. Vectorization of such codes is even more complex. The recent branch-avoiding model shows how to remove such control flow restrictions by replacing branches with an equivalent ...

Privacy, and Why You Should Care
Katrina Ligett - COLLOQUIUM LECTURE
יום שלישי, 12.06.2018, 14:30
Room 337 Taub Bld.
Over the past decade, the computer science research community has converged around a formal notion of data privacy, known as differential privacy, and has made substantial progress in establishing the theoretical foundations of this notion. In this talk, I will give a brief overview of differential privacy and the relevant mathematical toolkit, and then we will discuss the implications and frontiers of this research space. Can differential privacy ever be practical? How might it be useful, even ...

When Dictionary Learning Meets Graph Signal Processing
יעל ינקלבסקי
יום שלישי, 12.06.2018, 11:30
Taub 337
Dictionary Learning techniques aim to find sparse signal representations that capture prominent characteristics in the given data. For signals residing on non-Euclidean topologies, represented by weighted graphs, an additional challenge is incorporating the underlying geometric structure of the data domain into the learning process. In this talk, we introduce an approach that aims to infer and preserve the local intrinsic geometry of the data. Combining ideas from spectral graph theory, manifold...

System-Aware Compression: Optimizing Imaging Systems from the Compression Standpoint
יהודה דר
יום שלישי, 12.06.2018, 10:15
Taub 337
In typical imaging systems, an image/video is first acquired, then compressed for transmission or storage, and eventually presented to human observers using different and often imperfect display devices. While the resulting quality of the perceived output image may severely be affected by the acquisition and display processes, these degradations are usually ignored in the compression stage, leading to an overall sub-optimal system performance. In this work we propose a compression methodology t...

Coding Theory: Recent Results in Covert Communication
סידהארט ג'אגי (אונ' הונג-קונג)
יום ראשון, 10.06.2018, 14:30
טאוב 601
Covert communication considers the following problem -- if Alice wishes towhisper to Bob while ensuring that the eavesdropper Eve cannot even detect whether or not Alice is whispering, how much can she whisper. Ensuring such a stringent security requirement can be met requires new ideas from information theory, coding theory, and cryptography. In this talk I will survey the state of the existing literature (recent information-theoretic capacity-style results for a variety of settings), and...

CGGC Seminar: Subdivision Directional Fields
אמיר וקסמן (אונ' אוטרכט)
יום ראשון, 10.06.2018, 13:30
חדר 337, בניין טאוב למדעי המחשב
Subdivision surfaces are a mainstream methodology in computer graphics and geometry processing to create smooth surfaces with a multiresolution hierarchy. The recent popularity of Isogeometric Analysis brought a renewed interest in such surfaces for the purpose of solving differential equations. We define subdivision methods for piecewise-constant directional fields and show how such methods can be used for robust and efficient vector field processing on subdivision surfaces....

Theory Seminar: Sub-logarithmic Distributed Oblivious RAM with Small Block Size
תאמר מור (מדעי המחשב, טכניון)
יום רביעי, 06.06.2018, 12:30
טאוב 201
Oblivious RAM (ORAM) is a cryptographic primitive that allows a client to securely execute RAM programs over data that is stored in an untrusted server. Distributed Oblivious RAM is a variant of ORAM, where the data is stored in m non-colluding servers. Extensive research over the last few decades have succeeded to reduce the bandwidth overhead of ORAM schemes, both in the single-server and the multi-server setting, from O(\sqrt{N}) to O(1). However, all known protocols that achieve a sub-logari...

Matching Visual Data
Shai Avidan - COLLOQUIUM LECTURE
יום שלישי, 05.06.2018, 14:30
Room 337 Taub Bld.
Matching pixels is used in various computer vision applications such as template matching, tracking and image editing. I will give an overview of my work in this field with an emphasize on two components. The first is how to represent the data, and the second is what similarity measure to use. I will demonstrate the results on several applications including object tracking and image editing. Bio: Shai Avidan is an Associate Professor at the School of Electrical Engineering at Tel-Aviv Unive...

כנס Qubit 2018
יום ראשון, 03.06.2018, 09:30
בניין טאוב למדעי המחשב
מרכז המחקר לאבטחת סייבר ע"ש הירושי פוג'יאוורה שמח להזמניכם לכנס: Qubit 2018 - Quantum Communication: Celebrating Bennett & Brassard's Wolf Prize for Physics>אשר יתקיים בפקולטה למדעי המחשב בטכניון ביום רא...

Theory Seminar: Approximation Algorithms for Dynamic NFV Workload
ירון פיירסטיין (מדעי המחשב, טכניון)
יום רביעי, 30.05.2018, 12:30
טאוב 201
The dynamic NFV placement problem captures one of the main challenges facing the telecom industry following the emergence of the Network Function Virtualization (NFV) networking paradigm, that is, deciding the placement of network functions while taking into consideration the dynamic nature of networks and workloads. We model the problem as a generalization of the classic Uncapacitated Facility Location (UFL) problem, where we consider both multiple types of commodities and dynamic clients whos...

ceClub: Space Bounds for Reliable Coded Storage, and Beyond
אלכסנדר שפיגלמן (הנדסת חשמל, טכניון)
יום רביעי, 30.05.2018, 11:30
חדר 861, בניין מאייר, הפקולטה להנדסת חשמל
The bulk of the talk will deal with space requirements of reliable storage algorithms in asynchronous distributed systems. A number of recent works have used codes in order to achieve a better storage cost than the well-known replication approach. However, a closer look reveals that they incur extra costs in certain scenarios. Specifically, if multiple clients access the storage concurrently, then existing asynchronous code- based algorithms may store a number of copies of the dat...

Accelerating Innovation Through Analogy Mining
Dafna Shahaf - COLLOQUIUM LECTURE
יום שלישי, 29.05.2018, 14:30
Room 337 Taub Bld.
The availability of large idea repositories (e.g., the U.S. patent database) could significantly accelerate innovation and discovery by providing people with inspiration from solutions to analogous problems. However, finding useful analogies in these large, messy, real-world repositories remains a persistent challenge for either human or automated methods. In this work we explore the viability and value of learning simpler structural representations which specify the purpose of a product and ...

יוחאי בלאו (הנדסת חשמל, טכניון)
יום שלישי, 29.05.2018, 11:30
חדר 1061, בניין מאייר, הפקולטה להנדסת חשמל
Image restoration algorithms are typically evaluated by some distortion measure (e.g. PSNR, SSIM, IFC, VIF) or by human opinion scores that quantify perceived perceptual quality. In this work, we prove mathematically that distortion and perceptual quality are at odds with each other. Specifically, we study the optimal probability for correctly discriminating the outputs of an image restoration algorithm from real images. We show that as the mean distortion decreases, this probability must increa...

ניהול מו"מ: איך לנהל מו"מ על חוזה העסקה
שרה קרוא (Talent management specialist)
יום שני, 28.05.2018, 17:00
Room 337 Taub Bld.
אנו שמחים להזמין אתכם לשישי בסדרת מפגשים בנושא קריירה וחיפוש עבודה שיתקיים ביום שני, 28 במאי 2018, בשעה 17:00 בחדר 337, בניין טאוב למדעי המחשב. שרה קרוא, (Talent management specialist), תרצה על "...

CGGC Seminar: Integer-Only Cross Field Computation
נחום פרחי (מדעי המחשב, טכניון)
יום ראשון, 27.05.2018, 13:30
חדר 337, בניין טאוב למדעי המחשב
We propose a new iterative algorithm for computing smooth cross fields on triangle meshes that is simple, easily parallelizable on the GPU and finds solutions with lower energy and fewer cone singularities than state-of-the-art methods. Our approach is based on a formal equivalence, which we prove, between two formulations of the optimization problem. This equivalence allows us to eliminate the real variables and design an efficient grid search algorithm for the cone singularities. W...

Theory Seminar: Approximate Modularity Revisited
מיכל טלגם-כהן (מדעי המחשב, טכניון)
יום רביעי, 23.05.2018, 12:30
טאוב 201
Set functions with convenient properties (such as submodularity) often arise in algorithmic game theory, and allow for improved properties of optimization algorithms and mechanisms. It is natural to ask (e.g., in the context of data driven applications) how robust such properties are, and whether small deviations from them can be tolerated. We consider two such questions in the important special case of linear set functions. One question that we address is whether any set function that approxima...

Pixel Club: Numerical Methods in Visual Computing: what we can learn from each other
אורי אשר (אונ' קולומביה הבריטית)
יום רביעי, 23.05.2018, 11:30
חדר 337, בניין טאוב למדעי המחשב
Visual computing is a wide area that includes computer graphics and image processing, where the "eyeball-norm" rules. I will briefly discuss two case studies involving numerical methods and analysis applied to this area. The first case study involves motion simulation and calibration of soft objects such as plants, skin, and cloth. The governing elastodynamics PDE system, discretized in space already at the variational level using co-rotated FEM, leads to a large, expensive to assemble, dynamica...

ceClub: RISC-V - Why a new CPU Architecture?
עודד למפל (מלאנוקס)
יום רביעי, 23.05.2018, 11:30
חדר 861, בניין מאייר, הפקולטה להנדסת חשמל
Who needs a new Instruction Set Architecture (ISA)? Architectures have reached some unspoken Truce through Markets Segment dominance (IA64 - PC and Server market, ARM - Mobile market). IA and ARM have ruled the PC/Server and Mobile markets, respectively, for years and have prevailed aggressive competitive assaults Some Markets are still pursuing a standard (ARM and Various DSPs - IoT market, GPGPU (Nvidia) and TPU (Google) - IA/ML applications) IoT and IA/ML segments have not yet matured and no ...

Pixel Club: OATM: Occlusion Aware Template Matching by Consensus Set Maximization
סיימון קורמן (מכון ויצמן למדע)
יום שלישי, 22.05.2018, 11:30
חדר 337, בניין טאוב למדעי המחשב
We present a novel approach to template matching that is efficient, can handle partial occlusions, and comes with provable performance guarantees. A key component of the method is a reduction that transforms the problem of searching a nearest neighbor among N high-dimensional vectors, to searching neighbors among two sets of order sqrt{N} vectors, which can be found efficiently using range search techniques. This allows for a quadratic improvement in search complexity, and makes the method scala...

Theory Seminar: Learning Software Constraints via Installation Attempts
רן בן-בשט (מדעי המחשב, טכניון
יום רביעי, 16.05.2018, 12:30
טאוב 201
Modern software systems are expected to be secure and contain all the latest features, even when new versions of software are released multiple times an hour. Each system may include many interacting packages. The problem of installing multiple dependent packages has been extensively studied in the past, yielding some promising solutions that work well in practice. However, these assume that the developers declare all the dependencies and conflicts between the packages. Often, the ...

ceClub: Security and Reliability Using OS
נועם שלו (הנדסת חשמל,טכניון)
יום רביעי, 16.05.2018, 11:30
חדר 861, בניין מאייר, הפקולטה להנדסת חשמל
Computer systems have been developed tremendously over the past few years and as a result new challenges arise in the fields of security and reliability. In this talk I will present two approaches that utilize the operating system for providing solutions to urgent challenges in these fields. First, I will speak about the Core Surprise Removal (CSR) algorithm which explores the uncharted field of providing reliability in face of hardware faults and makes a unique use of Hardware Transactional Mem...

Pixel Club: Deep Learning for Biomedical Imaging: Can We Get Better, Higher or Faster?
תמי ריקלין רביב (אונ' בן-גוריון)
יום שלישי, 15.05.2018, 11:30
חדר 337, בניין טאוב למדעי המחשב
Recent progress in imaging technologies leads to a continuous growth in biomedical data, which can provide better insight into important clinical and biological questions. Advanced machine learning techniques, such as artificial neural networks are brought to bear on addressing fundamental medical image computing challenges such as segmentation, classification and reconstruction, required for meaningful analysis of the data. Nevertheless, the main bottleneck, which is the lack of annotated examp...

Sub-logarithmic Distributed Oblivious RAM with Small Block Size
תאמר מור
יום שני, 14.05.2018, 14:30
Taub 601
Oblivious RAM (ORAM) is a cryptographic primitive that allows a client to securely execute RAM programs over data that is stored in an untrusted server. Distributed Oblivious RAM is a variant of ORAM, where the data is stored in m non-colluding servers. Extensive research over the last few decades have succeeded to reduce the bandwidth overhead of ORAM schemes, both in the single-server and the multi-server setting, from O(\sqrt{N}) to O(1). However, all known protocols that achieve a sub-logari...

CGGC Seminar: Rigid Motions on 3D Digital Space
קספר פלוטה (אונ' פריס)
יום ראשון, 13.05.2018, 13:30
חדר 337, בניין טאוב למדעי המחשב
In digital geometry, Euclidean objects are represented by their discrete approximations e.g., subsets of the lattice of integers. Rigid motions of such sets have to be defined as maps from and onto a given discrete space. One way to design such motions is to combine continuous rigid motions defined on Euclidean space with a digitization operator. However, digitized rigid motions often no longer satisfy properties of their continuous siblings. Indeed, due to digitization, such transformations do...

Hardware Security Seminar: Main Cyber Security Challenges in Vehicles and in Vehicle-to-vehicle Communication
יוני כהנא (ג'נרל מוטורס ישראל)
יום ראשון, 13.05.2018, 09:30
טאוב 601
The review will include the main modern cyber security challenges that exists in vehicles today and in the coming future. There will specific focus on security aspects in vehicle-to-vehicle communication (v2v or C2C) , includes privacy , authenticity and integrity of the communication in the relevant scenarios Bio: Yoni is managing the product Cyber Security Group in General Motors Israel that in-charge to secure crucial elements in the vehicle. Yoni was...

Efficient Extreme Classification
איתי עברון
יום רביעי, 09.05.2018, 13:30
Taub 601
In extreme classification problems, machine learning algorithms are required to map instances to labels from an extremely large label set. We build on a recent extreme classification framework with logarithmic time and space, and on a general approach for error correcting output coding (ECOC), and introduce a flexible and efficient approach accompanied by bounds. Our framework employs output codes induced by graphs, and offers a tradeoff between accuracy and model size. We show how to find...

Theory Seminar: Complexity Analysis for Relational Queries over Text
ליאת פטרפרוינד (מדעי המחשב, טכניון)
יום רביעי, 09.05.2018, 12:30
טאוב 201
A recent principled approach to information extraction from text views the query as an ordinary relational query, but not on ordinary relations; instead, the relations are tuples of intervals, or "spans," extracted from text documents. A prominent example is Fagin et al.'s "regular spanners," which are the closure of regular expressions with capture variables (used for tokenization, n-grams, segmentation, etc.) under the relational algebra. In this talk I will present several resear...

Frugal Counting
ירון קסנר
יום רביעי, 09.05.2018, 11:30
Taub 601
In this talk we will present improvements to the accuracy, memory and speed of counting algorithms. Counters are one of the most basic building blocks in networking, big data analytics and other fields. To cope with increasing line rates, counters must be accessed quickly and be kept on small fast memory. Further, to reach concise and exhaustive conclusions about data, accurate estimations must be kept for large numbers of counters. We first present a closed form representation of the optimal es...

ceClub: But Why Does It Work? A "Rational Protocol Design" Treatment of Bitcoin
חואן גאראי (אונ' טקסס)
יום רביעי, 09.05.2018, 11:30
חדר 861, בניין מאייר, הפקולטה להנדסת חשמל
As the first and most popular decentralized cryptocurrency to date, Bitcoin has ignited much excitement, not only for its novel realization of a central bank-free financial instrument, but also as an alternative approach to classical problems in distributed computing and cryptographic protocols, such as reaching consensus in the presence of misbehaving parties. In this talk, after a brief introduction to the innovative and distributedly-maintained data structure known as the "blockch...

סדנת שרתים מרוחקים
יום שני, 07.05.2018, 18:30
חדר 337, בניין טאוב למדעי המחשב
הפקולטה למדעי המחשב שמחה להזמינכם לשלישית בסדרת סדנאות ללימוד כלים יישומיים לעבודה על קוד, פיתוח וניהול פרוייקטים, והפעם בנושא: "עבודה עם שרתים מרוחקים: איך מגישים תרגילים בלי להישאר לישון בחווה" בהשתתפות יונית גרובר-חזני, מהנדסת DEVOPSE ב-WAZE. ...

Pixel Club: The Steerable Graph Laplacian and its Application to Filtering Image Datasets
בוריס לנדא (אונ' תל-אביב)
יום שני, 07.05.2018, 11:30
חדר 337, בניין טאוב למדעי המחשב
In recent years, improvements in various scientific image acquisition techniques gave rise to the need for adaptive processing methods, particularly aimed for large data-sets corrupted by noise and deformations. Motivated by challenges in cryo-electron microscopy (cryo-EM), we consider the problem of reducing noise in a dataset of images admitting a certain unified structure. In particular, we consider datasets of images sampled from an underlying low-dimensional manifold (i.e. an image-val...

האקתון האביב במדעי המחשב
יום חמישי, 03.05.2018, 09:00
בניין טאוב למדעי המחשב
הפקולטה למדעי המחשב מזמינה אתכם להרכיב צוות מנצח ולהתחיל לעבוד על רעיון מבריק להאקתון האביב שיתקיים בימים חמישי-שישי, 3-4 במאי, 2018, בבניין טאוב.למדעי המחשב. בתוכנית: 24 שעות של עבודה בצוותים, בליווי מדריכים מובילים, כיבוד ופרסים כספיים (לזוכים במק...

Theory Seminar: Distributed PCP Theorems for Hardness of Approximation in P
אביעד רובינשטיין (אונ' סטנפורד)
יום רביעי, 02.05.2018, 12:30
טאוב 201
We present a new model of probabilistically checkable proof (PCP), which we call "Distributed PCP": A satisfying assignment (x in {0,1}^n) to a SAT instance is shared between two parties (Alice knows x_1, ... x_{n/2}, and Bob knows x_{n/2+1},...,x_n). Their goal is to jointly write a PCP for x, while exchanging little or no information. Using our new framework, we obtain, for the first time, PCP-like hardness of approximation results for problems in P....

Genetics media
Yaniv Erlich - COLLOQUIUM LECTURE - RESCHEDULED FROM 10/4/18
יום שלישי, 01.05.2018, 14:30
Room 337 Taub Bld.
In the last decade, the human population has produced zettabytes (10^21) of digital data. This creates immense opportunities and challenges for biology research. In this talk, I will present two research directions on the intersection between genetics and data, which we dub "genetic media". First, I will speak about crowd sourcing massive genetic data using social media. We collected over 80 million profiles from the largest social-media website driven by genealogy and constructed a single...

Template Matching with Deformable Diversity Similarity
איתמר תלמי
יום שלישי, 01.05.2018, 11:30
Taub 337
We propose a novel measure for template matching named Deformable Diversity Similarity -- based on the diversity of feature matches between a target image window and the template. We rely on both local appearance and geometric information that jointly lead to a powerful approach for matching. Our key contribution is a similarity measure, that is robust to complex deformations, significant background clutter, and occlusions. Empirical evaluation on the most up-to-date benchmark shows that our ...

פצח את קוד הראיון שלך
דור גרוס (פייסבוק ישראל)
יום שני, 30.04.2018, 17:00
Room 337 Taub Bld.
אנו שמחים להזמין אתכם לחמישי בסדרת מפגשים בנושא קריירה וחיפוש עבודה שיתקיים ביום שני, 30 באפריל 2018, בשעה 17:00 בחדר 337, בניין טאוב למדעי המחשב. מר דוד גרוס, מהנדס תוכנה בפייסבוק ישראל, ירצה על "פיצוח קוד הראיון שלך": כיצד ...

יורוקריפט 2018
יום ראשון, 29.04.2018, 18:00
תל-אביב
EUROCRYPT 2018 הוא הכנס הבינלאומי השנתי ה-37 בתחום התיאוריה ויישומי טכניקות ההצפנה אשר ידון בכל היבטי הקריפטולוגיה, כולל יסודות תיאורטיים, פריסה של תוכניות קריפטוגרפיות, קריפטאנליזה של סטנדרטים נפוצים, פרוטוקול...

קריירת מחקר בתעשייה
יום ראשון, 29.04.2018, 15:30
מועדון משתלמים, בניין טאוב למדעי המחשב
אנו שמחים להזמין אתכם למפגש ייעודי לסטודנטים לתארים מתקדמים, שיעסוק הפעם בקריירת מחקר בתעשייה: האם יש מחקר בתעשייה בישראל? מהם סוגי המשרות ומסלולי קריירה הקיימים. המפגש יתקיים ביום ראשון, 29 באפריל 2018, בשעה 15:30 במועדון משתלמים, קומה2, בניין ...

On Graph Learning
חסן עבאסי
יום חמישי, 26.04.2018, 11:00
Taub 701
A graph learning problem is a problem of finding a hidden graph $G=(V,E)$ using edge-detecting queries, where an edge-detecting query $Q_G(S)$, for $S \subseteq V$ is: does S contain at least one edge of G? The main question is how many queries do we need to find all the edges. Graph learning is a well-studied problem. It has been studied for general graphs, and also for specific graph families (i.e. matching, stars, cliques and others). This problem has also been generalized to learning a hype...

On Graph Learning
חסן עבאסי
יום חמישי, 26.04.2018, 11:00
Taub 701
A graph learning problem is a problem of finding a hidden graph $G=(V,E)$ using edge-detecting queries, where an edge-detecting query $Q_G(S)$, for $S \subseteq V$ is: does S contain at least one edge of G? The main question is how many queries do we need to find all the edges. Graph learning is a well-studied problem. It has been studied for general graphs, and also for specific graph families (i.e. matching, stars, cliques and others). This problem has also been generalized to learning a hype...

Theory Seminar: Distributed Spanner Approximation
מיכל דורי (מדעי המחשב, טכניון)
יום רביעי, 25.04.2018, 12:30
טאוב 201
A k-spanner is a sparse subgraph that preserves distances up to a multiplicative factor of k. First introduced in the late 80's, spanners have been central for numerous applications, such as synchronization, compact routing tables, approximate shortest paths, and more. This talk focuses on distributed construction of approximate minimum spanners, presenting both algorithmic and hardness results, in the classical LOCAL and CONGEST models of distributed computing. In both models vertic...

היום! יום פתוח לתארים מתקדמים במדעי המחשב
יום רביעי, 25.04.2018, 12:15
חדר 337, בניין טאוב למדעי המחשב
היום הפתוח לקראת ההרשמה לשנה"ל תשע"ט מזמין בוגרי תואר ראשון מצטיינים מכל האוניברסיטאות להגיע לטכניון ולהתרשם מהפקולטות למדעי המחשב, לפגוש חברי סגל וסטודנטים לתארים מתקדמים ולשמוע הרצאה מרתקת מפי משה לוינגר, מנהל בכיר, י.ב.מ. מחקר, חיפה: "האם ת...

1+1=3: Combining Object Storage with Other Data Services
Michael Factor - COLLOQUIUM LECTURE
יום שלישי, 24.04.2018, 14:30
Room 337 Taub Bld.
AI, Cognitive, Analytics, IoT all run on data. This data is needed by data scientists, line of business, developers, CDOs and others. Without data, in fact, one can do very little that is interesting or of value. Object storage, the default storage for the PBs and EBs of unstructured data in clouds, has brought huge efficiencies to storing and managing data. In this presentation, we will provide an overview of object storage, using IBM's Cloud Object Storage (formerly Cleversafe) as an example....

Pixel Club: On GANs and GMMs
איתן ריצ'רדסון (האונ' העברית)
יום שלישי, 24.04.2018, 11:30
חדר 337, בניין טאוב למדעי המחשב
GANs have recently gained attention due to their success in generating realistic new samples of natural images, yet the extent to which such models capture the statistics of full images is poorly understood. In this work we present a simple method to evaluate generative models based on relative proportions of samples that fall into predetermined bins. Applying our method to GANs shows that they typically fail to capture very basic properties of the distribution. As an alternative to the opaque a...

כנס: The Information Era: Past, Present and Future
יום שלישי, 24.04.2018, 09:00
אודיטוריום 2, בניין טאוב למדעי המחשב
הפקולטה למדעי המחשב שמחה להזמינכם לכנס עמותת מרקוני בנושא: The Information Era: Past, Present and Future אשר יתקיים ביום שלישי, 24 באפריל, 2018 באודיטוריום 2, בניין טאוב למדעי המחשב. אורח הכבוד יהיה פרופ' אנדרו ויטרבי, ממייסדי קוואלקום, שישת...

Two Researches on Lattice Animals
יופיי ז'נג
יום ראשון, 22.04.2018, 13:30
Taub 301
Lattice animals are connected subgraphs of a lattice. In this talk, we consider two types of lattices, the $d$-dimensional hypercubic lattice and the triangular lattice, where the animals are frequently referred to as $d$-dimensional polycubes and polyiamonds, respectively. Denote the number of $d$-dimensional polycubes of volume $n$ and perimeter defect $k$ as $B(n,k,d)$, where $k$ is the deviation from the maximum perimeter. To-date, no formulae of $B(n,k,d)$ are known. In the first part of...

Textual Membership Queries
יונתן זרצקי
יום שלישי, 17.04.2018, 12:30
Taub 601
Labeling textual data by humans can become very time-consuming and expensive, yet critical for the success of an automatic text classification system. In order to minimize the human-labeling efforts, we propose a novel active learning (AL) solution, which does not rely on existing sources of unlabeled data. It uses a small amount of of labeled data as the core set for the synthesis of useful membership queries (MQs) - unlabeled instances synthesized by a computer, for human classification. Ou...

Hardware Security Seminar: Software and Hardware Based Approached for Fine Grain Memory Protection
אבי מנדלסון (מדעי המחשב, טכניון)
יום ראשון, 15.04.2018, 09:30
טאוב 601
Future servers are expected to have huge amount of volatile and nonvolatile main memory that can be directly accessed by the processors. Managing such a memory hierarchy is a major concern of computer and of hardware security architects. Thus, while computer architects are aiming at increasing the page and region size, which is being controlled by a single entry at of the TLB (e.g., 1G page size), hardware security architects aims at protecting variable size of regions, sta...

Theory Seminar: Voronoi Diagrams for Planar Graphs
אורן ויינמן (אונ' חיפה)
יום רביעי, 11.04.2018, 12:30
טאוב 201
Given a set of points (sites) in the plane, a Voronoi diagram is a partitioning of the plane into regions such that each region contains one site and all points closer to this site than to any other site. Voronoi diagrams have practical and theoretical applications in a large number of fields. In this talk, I will overview the exciting new uses of Voronoi diagrams for planar graph algorithms. In particular, I will describe an efficient construction of Voronoi diagrams for planar graphs with two ...

Pixel Club: Viewpoint Estimation - Insights & Model
גלעד דיבון (הנדסת חשמל, טכניון)
יום רביעי, 11.04.2018, 11:30
חדר 1061, בניין מאייר, הפקולטה להנדסת חשמל
This thesis addresses the problem of viewpoint estimation of an object in a given image, where the objects belong to several known categories. Convolutional Neural Networks were recently applied to this problem, leading to large improvements of state-of-the-art results. Two major approaches have been pursued: a regression approach, which handles the continuous values of view points naturally, and a classification approach, which discretized the space of viewpoints. We follow the second appr...

MAGIC SQUARES WONDER CUBES and OTHER SAME SUM OBJECTS
Prof. Emeritus Azaria Paz - Distinguished Guest Lecture
יום שלישי, 10.04.2018, 14:30
Room 337 Taub Bld.
A MAGIC SQUARE is an arrangement of nxn disjoint integers on an nxn square in a way such that the n rows, the n columns and the two diagonals of the square sum to the same constant which is called THE MAGIC CONSTANT. We will consider in this lecture magic squares with n=3 only. We introduce a new generalization of magic squares where 6 non equivalent positive magic squares having the same magic constant are inscribed on the six faces of a cube. The six magic squares on the cube are chosen...

Parallel Execution Using Memory Versioning and Renaming
ערן גלעד
יום שלישי, 10.04.2018, 14:00
Taub 601
The memory interface is a striking example of a hardware/software interface that is ill-suited for parallelism, and specifically for parallel access to the program's state. Even on modern computers, that interface follows the design described in the von Neumann architecture more than 70 years ago. This interface design is fundamentally sequential and suited for serial instruction execution. Indeed, modern memory systems allow multiple cores to read and write state concurrently, and the underlyin...

Pixel Club: Video Scene Detection Using Optimal Sequential Grouping
דניאל רוטמן (IBM)
יום שלישי, 10.04.2018, 11:30
חדר 337, בניין טאוב למדעי המחשב
Video scene detection is the task of temporally dividing a video into its semantic sections called "scenes" - a series of video shots depicting a high-level concept or story (action/drama scene, news segment etc.). This is an important preliminary step for effective analysis of heterogeneous video content, and can help with building a table-of-contents, enabling fast browsing and skipping between scenes, and identifying the contextual boundaries of the content in the video. In this talk we will ...

סדנת: "מתכנתים בצוותא"
יום שני, 09.04.2018, 18:30
Room 337 Taub Bld.
הפקולטה למדעי המחשב שמחה להזמינכם לשנייה בסדרת סדנאות ללימוד כלים יישומיים לעבודה על קוד, פיתוח וניהול פרוייקטים, והפעם בנושא: "איך עובדים על פרוייקט קוד ביחד (ונשארים חברים)": - איך מחלקים עבודה כשאין זמן להיפגש? - מה עושים כשאחד השותפים חזק/חלש מא...

Compile-Time LL(1) Parsing in Java's Typesystem
אורי רוט
יום רביעי, 28.03.2018, 13:30
Taub 401
A recent result shows that the Java type system and its type-checker are mighty enough to emulate deterministic pushdown automata (DPDAs), and hence, capable (disregarding cost) to recognize deterministic context free languages (DCFGs). The problem is of concrete practical value, since, as it turns out, this recognition is essential for automatic generation of fluent APIs from their specification. This work advances the state of knowledge, in presenting, for the first, an efficient (specif- ical...

Quality and Algebraic Representation of Tests
דור מעין
יום רביעי, 28.03.2018, 12:30
Taub 401
The quality of unit tests gains substantial importance in modern software systems. We explore the way in which Junit tests are written in real world Java systems. We analyse 112 Java repositories and measure the quality of unit tests by finding patterns which indicate good practices of coding. Our results show that the quality of real world unit tests is low, and that in many cases, unit tests don’t follow the well-known recommendations for writing unit tests. These results demonstrate the nee...

Serializability Reasoning for Eventual Consistency
Dimitar Dimitrov - GUEST LECTURE
יום שלישי, 27.03.2018, 14:30
Room 337 Taub Bld.
High-availability requirements in modern software triggered the widespread adoption of eventually consistent data stores. Unfortunately, reasoning about the correctness of programs running under eventual consistency is a challenging task, largely due to the possibility of very weak system behaviors. In this talk, I will present new automated techniques that help developers precisely identify problematic weak behaviors. Our starting point will be to adopt conflict serializability as a cor...

Pixel Club: "Zero-Shot" Super-Resolution using Deep Internal Learning
אסף שוחר (מכון ויצמן למדע)
יום שלישי, 27.03.2018, 11:30
חדר 337, בניין טאוב למדעי המחשב
Deep Learning has led to a dramatic leap in Super-Resolution (SR) performance in the past few years. However, being supervised, these SR methods are restricted to specific training data, where the acquisition of the low-resolution (LR) images from their high-resolution (HR) counterparts is predetermined (e.g., bicubic downscaling), without any distracting artifacts (e.g., sensor noise, image compression, non-ideal PSF, etc). Real LR images, however, rarely obey these restrictions, resulting in p...

When Codes for Storage Systems Meet Storage Systems
יום שלישי, 27.03.2018, 10:30
Room 601 Taub Bld.
Large-scale storage systems lie at the heart of the big data revolution. As these systems grow in scale and capacity, their complexity grows accordingly, building on new storage media, hybrid memory hierarchies, and distributed architectures. Numerous layers of abstraction hide this complexity from the applications, but also hide valuable information that could improve the system's performance considerably. I will demonstrate how to bridge this semantic gap in the context of erasure codes...

אירוע מחקר מטעם eBay במדעי המחשב
יום חמישי, 22.03.2018, 10:30
חדר 337, בניין טאוב למדעי המחשב
...

היום! שלב הגמר - תחרות הפרוייקט המצטיין בחסות אמדוקס 2018
יום רביעי, 21.03.2018, 12:30
אודיטוריום 2, בניין טאוב למדעי המחשב
הנכם מוזמנים להצגת הפרוייקטים שעלו לגמר בתחרות הפרוייקט המצטיין 2018. הצוותים המתמודדים יציגו את מחקריהם ויענו לשאלות השופטים והקהל. האירוע יתקיים ביום רביעי, 21 במרס, 2018, בין השעות 12:30-15:00, באודיטוריום טאוב 2, בניין טאוב למ...

Theory Seminar: The Firing Squad Problem Revisited
שלמה מורן (מדעי המחשב, טכניון)
יום רביעי, 21.03.2018, 12:30
טאוב 201
In the classical firing squad problem, an unknown number of nodes represented by identical finite states machines is arranged on a line and in each time unit each node may change its state according to its neighbors' states. Initially all nodes are passive, except one specific node located at an end of the line, which issues a fire command. This command needs to be propagated to all other nodes, so that eventually all nodes simultaneously enter some designated firing" state. A na...

Cued Person Identification From Motion
איגור קביאטקובסקי
יום רביעי, 21.03.2018, 11:30
Taub 601
We introduce a new approach for identifying individuals based on their motion patterns in interactive scenarios. We formalize the identification process in the context of a sequential message exchange session between the subject and the system. The subject is modeled with a probabilistic generative model inspired by the Human Information Processing (HIP) paradigm. At each stage, the system presents a visual stimulus (a cue) to the subject and records their motion response. The cue is selecte...

Cued Person Identification From Motion
איגור קביאטקובסקי
יום רביעי, 21.03.2018, 11:30
Taub 601
We introduce a new approach for identifying individuals based on their motion patterns in interactive scenarios. We formalize the identification process in the context of a sequential message exchange session between the subject and the system. The subject is modeled with a probabilistic generative model inspired by the Human Information Processing (HIP) paradigm. At each stage, the system presents a visual stimulus (a cue) to the subject and records their motion response. The cue is selecte...

Pixel Club: Why is it So Difficult to Obtain Medical Images for R&D ?!
נחום קריתי (אונ' תל-אביב)
יום ראשון, 18.03.2018, 11:30
חדר 337, בניין טאוב למדעי המחשב
Research in medical image analysis, especially after the deep-learning revolution, relies on access to medical image databases. Specific categories of medical images have been made available as “challenges” to facilitate scientific benchmarking. Nevertheless, R&D of real-world clinical technologies usually requires data acquired while diagnosing and treating particular classes of patients using specific protocols and equipment. Such data cannot be normally found in common challenges, and can...

Improved Bounds for Online Multi-level Aggregation
אוהד טלמון
יום רביעי, 07.03.2018, 11:30
Taub 601
We consider a multi-level aggregation problem in a weighted rooted tree, studied recently by Bienkowski et al. In this problem requests arrive over time at the nodes of the tree, and each request specifies a non-decreasing waiting costs. A request is served by sending it to the root before its deadline at a cost equal to the weight of the path from the node in which it resides to the root. However, requests from different nodes can be aggregated, and served together, so as to save on cost. The c...

ceClub: Cascading Denial-of- Service Attacks on Wi-Fi Networks
דוד סטרובינסקי (אונ' בוסטון)
יום רביעי, 07.03.2018, 11:30
חדר 861, בניין מאייר, הפקולטה להנדסת חשמל
We unveil the existence of a vulnerability in Wi-Fi (802.11) networks, which allows an adversary to remotely launch a Denial-of- Service (DoS) attack that propagates both in time and space. This vulnerability stems from a coupling effect induced by hidden nodes. Cascading DoS attacks can congest an entire network and do not require the adversary to violate any protocol. We demonstrate the feasibility of such attacks through experiments with real Wi-Fi cards and extensive ns-3 simulations. To gai...

Sensory Routines for Indoor Autonomous Quad-Copter
אמיר גבע
יום שלישי, 06.03.2018, 15:30
Taub 601
Quad-Copters are versatile unmanned aircraft that are used for a myriad of tasks from manual aerial photography to autonomous surveillance. After their initial success in outdoors scenarios, indoor autonomous activity has recently been getting attention in research. Unlike the outdoor environment, which offers cheap and easy localization in the form of GPS, and usually lacks meaningful obstacles, indoor autonomous flight lacks a common means of localization and the tight spaces are fraught...

Sensory Routines for Indoor Autonomous Quad-Copter
אמיר גבע
יום שלישי, 06.03.2018, 15:30
Taub 601
Quad-Copters are versatile unmanned aircraft that are used for a myriad of tasks from manual aerial photography to autonomous surveillance. After their initial success in outdoors scenarios, indoor autonomous activity has recently been getting attention in research. Unlike the outdoor environment, which offers cheap and easy localization in the form of GPS, and usually lacks meaningful obstacles, indoor autonomous flight lacks a common means of localization and the tight spaces are fraught...

Sensory Routines for Indoor Autonomous Quad-Copter
אמיר גבע
יום שלישי, 06.03.2018, 15:30
Taub 601
Quad-Copters are versatile unmanned aircraft that are used for a myriad of tasks from manual aerial photography to autonomous surveillance. After their initial success in outdoors scenarios, indoor autonomous activity has recently been getting attention in research. Unlike the outdoor environment, which offers cheap and easy localization in the form of GPS, and usually lacks meaningful obstacles, indoor autonomous flight lacks a common means of localization and the tight spaces are fraught...

Sensory Routines for Indoor Autonomous Quad-Copter
אמיר גבע
יום שלישי, 06.03.2018, 15:30
Taub 601
Quad-Copters are versatile unmanned aircraft that are used for a myriad of tasks from manual aerial photography to autonomous surveillance. After their initial success in outdoors scenarios, indoor autonomous activity has recently been getting attention in research. Unlike the outdoor environment, which offers cheap and easy localization in the form of GPS, and usually lacks meaningful obstacles, indoor autonomous flight lacks a common means of localization and the tight spaces are fraught...

Sensory Routines for Indoor Autonomous Quad-Copter
אמיר גבע
יום שלישי, 06.03.2018, 15:30
Taub 601
Quad-Copters are versatile unmanned aircraft that are used for a myriad of tasks from manual aerial photography to autonomous surveillance. After their initial success in outdoors scenarios, indoor autonomous activity has recently been getting attention in research. Unlike the outdoor environment, which offers cheap and easy localization in the form of GPS, and usually lacks meaningful obstacles, indoor autonomous flight lacks a common means of localization and the tight spaces are fraught...

Hardware Security Seminar: The Journey of Intel® Software Guard Extension (SGX)
איתי ענתי (אינטל)
יום ראשון, 04.03.2018, 09:30
טאוב 601
In 2015, Intel launched its 6th generation Core, codenamed Skylake, that implements a new ISA for security – Intel® SGX. The talk will provide a short intro to SGX for the unfortunates who have not been exposed to Intel® SGX yet, but will focus mainly around the architectural enhancements since its first introduction and some of the design choices that were made. Short Bio: Ittai Anati is a Senior Principal Engineer at Intel Corporation’s CPU architecture team at In...

Hash Code 2018 של גוגל במדעי המחשב
יום חמישי, 01.03.2018, 18:30
חדר 337, בניין טאוב למדעי המחשב
גוגל תארח את Hub for the Online Qualification Round of Hash Code 2018 - בפקולטה למדעי המחשב, ביום ה', 1 במרס 2018, ב-18:30 (זמן אירופה), בחדר 337, בניין טאוב למדעי המחשב. המעוניינים לקחת חלק מתבקשים להירשם מראש....

Boosting Selective Regression with Ensembles
עמית גרוס
יום ראשון, 25.02.2018, 08:30
Taub 601
Using selective regression, it is possible to increase accuracy of predictions by abstaining from answering when there is insufficient knowledge. This work is about increasing the accuracy of selective regression even further and using simple selective models to create a more complex one, by using an ensemble of selective regressors. We demonstrate how to achieve improved accuracy by using two methods to build our ensemble. In the first approach, we first split the samples in the input dataset i...

End to End Deep Neural Network Frequency Demodulation of Speech Signals
דן אלבז
יום רביעי, 21.02.2018, 16:30
Taub 601
Frequency modulation (FM) is a form of radio broadcasting which is widely used nowadays and has been for almost a century. The widest use of FM is for radio broadcasting, which is commonly used for transmitting audio signal representing voice. Due to the effect of various distortions, noise conditions and other impairments imposed on the transmitted signal, the detection reliability severely deteriorates. As a result thereof, the intelligibility and quality of the detected speech decreases sign...

אוהד נח איתן
יום חמישי, 15.02.2018, 13:30
Taub 601
Trying to predict which items are likely to be accessed in the near future is the basis for most cache management policies. Storage workloads are often characterized by their level of frequency bias and their level of recency bias. The former captures how well the access frequency serves as a predictor for future accesses while the latter indicates how well does access recency predicts the future. Existing cache management policies have been grappling with the fact that different workloads exhib...

IOMMU-resistant DMA attacks
גיל קופפר
יום רביעי, 14.02.2018, 18:00
Taub 601
The direct memory access (DMA) mechanism allows I/O devices to independently access the memory without CPU involvement, improving performance but exposing systems to malicious DMA attacks. Hardware vendors therefore introduced IOMMUs (I/O memory management units), allowing operating systems to defend themselves by restricting DMAs to specific memory locations. When configured correctly, the latest generation of IOMMUs is thus considered an appropriate solution to the problem. We challenge this p...

Network Measurement meets Virtual Switching
רן בן-בשט
יום רביעי, 14.02.2018, 14:30
Taub 601
In modern cloud infrastructures, each physical server often runs multiple virtual machines and employs a software Virtual Switch (VS) to handle their traffic. In addition to switching, the VS performs network measurements, such as identifying the most frequent flows, which are essential for networking applications such as load balancing and intrusion detection. Unlike traditional streaming algorithms, which minimize the space requirements, the bottleneck in virtual switching measurement is the...

Pixel Club: Probabilistic Gathering of Agents With Simple Sensors
אריאל בראל (TASP)
יום שלישי, 13.02.2018, 11:30
חדר 337, בניין טאוב למדעי המחשב
We present novel probabilistic gathering algorithms for agents that can only detect the presence of other agents in front or behind them. The agents act in the plane and are identical and indistinguishable, oblivious and lack any means of direct communication. They do not have a common frame of reference in the plane and choose their orientation (direction of possible motion) at random. The analysis of the gathering process assumes that the agents act synchronously in selecting random orie...

Shape Synthesis and Analysis by Deformable Models
מתן סלע
יום חמישי, 08.02.2018, 11:30
Taub 401
The surface separating the interior of a given object or body from its exterior defines a shape. A key challenge in computer vision is to recover the shape from missing, partial, sparse or noisy observations such as images, depth maps or position sensors. Although in theory, surfaces can be arbitrarily embedded in space, the underlying structure of deformable shapes, such as the human face, is often driven by just a few degrees of freedom. For example, it has been shown that the space of the ...

Relational Framework for Information Extraction
יואב נחשון
יום רביעי, 07.02.2018, 13:30
Taub 401
Textual data written in some natural language carries concealed and valuable information within. Information Extraction (IE) is the task of automatically extracting this information in a structured representation. Standard relational database systems, who are highly suitable for representing structured information, are in fact incapable of performing deep text analysis, and therefore out-of-database solutions are often applied. However, this approach is prone to laborious development processes, ...

SciLMM: Computing heritability with millions of individuals
טל שור
יום רביעי, 07.02.2018, 11:30
Taub 601
The rapid digitization of genealogical and medical records enables the assembly of extremely large pedigree records spanning millions of individuals. Such pedigrees provide the opportunity to answer genetic and epidemiological questions in scales much larger than previously possible. Linear mixed models (LMMs) are often used for analysis of pedigree data. However, LMMs cannot naturally scale to large pedigrees spanning millions of individuals, owing to their steep computational and storage requi...

Efficiently combining privacy and availability in distributed storage systems
רומן שור
יום רביעי, 07.02.2018, 10:30
Taub 601
When sensitive data is stored in the cloud, the only way to ensure its secrecy is by encrypting it before it is uploaded. Not only is encryption itself computationally expensive but the encryption keys must also be safely stored and the data decrypted whenever it is downloaded. The emerging multi-cloud model, in which data is stored redundantly in two or more independent clouds, provides an opportunity to protect sensitive data with secret-sharing schemes. This approach trades complexity and ke...

אירוע חגיגי במלאת 40 שנה לאלגוריתם למפל-זיו
יום שני, 05.02.2018, 14:00
חדר 1003, בניין מאייר, הפקולטה להנדסת חשמל
הנכם מוזמנים לטקס והרצאה מיוחדת במלא 40 שנה לאלגוריתם למפל-זיו, מפי פרופ' מאיר פדר מביה"ס להנדסת חשמל באוניברסיטת תל-אביב, בנושא: "Beyond Compression: Lempel-Ziv in Learning and Prediction". האירוע יתקיים ביום שני, 5 בפברואר, 2018, בשעה 14:00, באודיטוריום 1003, בניין מאייר לה...

Theory Seminar: What Cannot Be Learned With Bounded Memory
דנה מושקוביץ (אונ' טקסס באוסטין)
יום רביעי, 31.01.2018, 12:30
טאוב 201
How does computational learning change when one cannot store all the examples one sees in memory? This question has seen a burst of interest in the past couple of years, leading to the surprising theorem that there exist simple concepts (parities) that require an extraordinary amount of time to learn unless one has quite a lot of memory. In this work we show that in fact most concepts cannot be learned without sufficient memory. This subsumes the aforementioned theorem and implies sim...

Ranked Enumeration of Tree Decompositions
נעם רביד
יום רביעי, 31.01.2018, 11:30
Taub 601
A tree decomposition of a graph facilitates computations by grouping vertices into bags that are interconnected in an acyclic structure; hence their importance in a plethora of problems such as query evaluation over databases and inference over probabilistic graphical models. The relative benefit from different tree decompositions is measured by diverse (sometime complex) cost functions that vary from one application to another. For generic cost functions like width and fill-in, an optimal tree ...

ceClub: Closing the Loop on Secure Operating System Design
עמית לוי (אונ' סטנפורדד)
יום רביעי, 31.01.2018, 11:30
טאוב 301
Secure system design should be guided by two principles: (1) system security should not impede third-party developers, who are often the main source of innovation, and (2) systems that secure third-party extensions also improve security by reducing the amount of specially-privileged first-party code. Unfortunately, very few systems today adhere to these principles. This is not merely a result of poor system building. It is hard to design highly extensible systems that are both sec...

Pixel Club: Improving Semantic Classification in Deep Learning Models
יקיר מטרי (הנדסת חשמל, טכניון)
יום שלישי, 30.01.2018, 11:30
חדר 337, בניין טאוב למדעי המחשב
We consider the image classification problem using deep models. Most of the works in the recent years consider only the flat precision (FP) measure as a benchmark. We follow a work done in recent years (called DeVISE), where a new measure named Hierarchical Precision (HP) is defined and used to measure the semantic accuracy of a classification model given an underlying hierarchy. While in DeVISE and other following works an extra side-information (e.g. textual corpus) is needed to build the sema...

Coding Theory: On the Metric Dimension of Cartesian Powers of a Graph
ניקיטה פוליאנסקי (טכניון)
יום ראשון, 28.01.2018, 14:30
טאוב 601
A set of vertices S resolves a graph if every vertex is uniquely determined by its vector of distances to the vertices in S. The metric dimension of a graph is the minimum cardinality of a resolving set of the graph. Fix a connected graph G on q ≥ 2 vertices, and let M be the distance matrix of G. We prove that if there exists w ∈ Z q such that \sum_i w_i =0 and the vector Mw, after sorting its coordinates, is an arithmetic progression with nonzero common difference, then the metric dimensio...

CGGC Seminar: Algorithms for Geometrically-Structured Optimization
ג'סטין סולומון (MIT)
יום ראשון, 28.01.2018, 13:30
חדר 337, בניין טאוב למדעי המחשב
Many problems in geometry processing, graph theory, and machine learning involve optimizations whose variables are defined over a geometric domain. The geometry of the domain gives rise to geometric structure in the optimization problem itself. In this talk, I will show how leveraging geometric structure in the optimization problem gives rise to efficient and stable algorithms applicable to a variety of application domains. In particular, I will describe new methods for problems arising in sh...

Inferring Cancer Dependencies on Metabolic Genes from Large-Scale Genetic Screens
שובל לגזיאל
יום חמישי, 25.01.2018, 12:30
Taub 601
Alterations in metabolic activity in tumors provide novel means to selectively target cancer cells. A powerful tool for identifying genes essential for cancer cell proliferation and survival is genome-scale RNAi and CRISPR-based genetic silencing screens. Integration of the measured gene essentiality datasets with genomic characterization of genes was shown to provide mechanistic understanding of tumor-specific gene essentiality. Here, we analyze the essentiality of metabolic enzyme-coding gene...

Processing Human Language with Recurrent Neural Networks and Multiple Training Signals
Yoav Goldberg - CS-Lecture
יום חמישי, 25.01.2018, 10:30
Room 601 Taub Bld.
While deep learning methods in Natural Language Processing are arguably overhyped, recurrent neural networks (RNNs), and in particular gated recurrent networks like the LSTM, emerge as very capable learners for sequential data. Thus, my group started using them everywhere. After briefly explaining what they are and why they are and giving a birds-eye overview of our work, I will describe a line of work in which we use LSTM encoders in a multi-task learning scenario. In these cases, we imp...

ערב חשיפה לרשתות תקשורת
יום רביעי, 24.01.2018, 18:30
טאוב 401
המעבדה לתקשורת מחשבים (LCCN) בפקולטה למדעי המחשב מזמינה אתכם לערב חשיפה לרשתות תקשורת - להכיר מקרוב את פעילות המעבדה, המחקרים והפרוייקטים שהיא מציעה ואת הצוות המוביל אותם. בהשתתפות: - פרופ' דני רז - ראש המעבדה: הרשת – לא מה שחשבתם - ...

On The Existence of q-Fano Planes
ניב הוקר
יום רביעי, 24.01.2018, 16:30
Taub 601
A q-Steiner System S_q(t,k,n) is set S of k-subspaces in a space of dimension n over a finite field, such that each t-subspace of the same space is contained in exactly one subspace from S. They have applications in random network Coding, but except for one set of parameters for which t>1, their existence is unknown. Specifically, the q-Fano plane S_q(2,3,7) is the smallest structure for which its existence is unknown. In the seminar I will show construction of a structure that might be a step f...

יריד חשיפה לפרוייקטים במציאות מדומה ורבודה
יום רביעי, 24.01.2018, 12:30
כניסת הקומה - בניין טאוב למדעי המחשב
המרכז לגרפיקה וחישוב גיאומטרי (CGGC) והמעבדה לעיבוד גיאומטרי של תמונות (GIP) מזמינים אתכם ליריד חשיפה והרשמה מוקדמת לקורס: מציאות וירטואלית\רבודה בשיתוף אינטל ורפאל. האירוע יתקיים ביום...

Theory Seminar: The Discrete-logarithm Problem with Preprocessing
הנרי קוריגן-גיבס (אונ' סטנפורד)
יום רביעי, 24.01.2018, 12:30
טאוב 201
We study discrete-log algorithms that use preprocessing. In our model, an adversary may use a very large amount of precomputation to produce an "advice" string about a specific group (e.g., NIST P-256). In a subsequent online phase, the adversary's task is to use the preprocessed advice to quickly compute discrete logarithms in the group. Motivated by surprising recent preprocessing attacks on the discrete-log problem, we study the power and limits of such algorithms. In particular...

ceClub: Recent Developments in Linkography Based Cyber Security
רוברט מיטצ'ל (Sandia National Laboratories)
יום רביעי, 24.01.2018, 11:30
טאוב 301
Cyber attacks on critical cyber systems are not decreasing in frequency or complexity. Aggressors choose the time and place of these engagements; protectors must identify, research and develop defensive techniques that provide an asymmetric advantage. A static, data-driven, preventative, automated defense is a losing strategy; an effective defense must be dynamic, behavioral, responsive and capitalize on a human in the loop. We propose human and machine performed linkography to detect, correlate...

יריד פרוייקטים בפיתוח תוכנה ב-IoT ו-Android
יום שלישי, 23.01.2018, 12:30
כניסת הקומה - בניין טאוב למדעי המחשב
המעבדה לפיתוח מערכות ותוכנה (SSDL) בפקולטה למדעי המחשב מזמינה אתכם לבקר ביריד פרוייקטים בפיתוח תוכנה ב-IoT ו-Android ובפרוייקט השנתי ולהתרשם מפרוייקטים חדשים אשר יוצגו על-ידי צוותי הפיתוח. האירוע יתקיים ביום שלישי, 23 בינואר 2018, ...

On the Expressive Power of ConvNets and RNNs as a Function of their Architecture
Amnon Shashua - COLLOQUIUM LECTURE -
יום שלישי, 23.01.2018, 10:30
CS Taub Build. Auditorium 2
Expressive efficiency refers to the relation between two architectures A and B, whereby any function realized by B could be replicated by A, but there exists functions realized by A, which cannot be replicated by B unless its size grows significantly larger. For example, it is known that deep networks are exponentially efficient with respect to shallow networks, in the sense that a shallow network must grow exponentially large in order to approximate the functions represented by a deep netwo...

A Persistent Queue for Non-Volatile Memory
מיכל פרידמן
יום שני, 22.01.2018, 14:30
טאוב 601
Non-volatile memory is expected to coexist with (or even displace) volatile DRAM for main memory in upcoming architectures. This has led to increasing interest in the problem of designing and specifying durable data structures that can recover from system crashes. Data structures may be designed to satisfy stricter or weaker durability guarantees to provide a balance between the strength of the provided guarantees and performance overhead. This seminar proposes three novel implementations of a c...

Coding Theory: Private Information Retrieval in Distributed Storage Systems
ייווי זאנג (מדעי המחשב, טכניון
יום ראשון, 21.01.2018, 14:30
טאוב 601
A private information retrieval (PIR) protocol allows a user to retrieve a data item from a database without revealing any information about the identity of the data item to a certain coalition of servers. In this talk, we will go over the recent results on PIR, especially on PIR in MDS-coded databases with colluding servers. We will also mention various other PIR models including PIR with robust/Byzantine servers or PIR with arbitrary collusion patterns. ...

On Polynomial time Constructions of Minimum Height Decision Tree
וסים מח'ול
יום רביעי, 17.01.2018, 14:30
Taub 601
We address the problem of constructing a minimum height decision tree of a class C in polynomial time. This problem has many interesting applications that include, to name a few, computer vision, group testing, exact learning from membership queries, and game theory. We further study the combinatorial measure, the extended teaching dimension, ETD(C) of a class C. We show an algorithm that achieves a ETD(C)-approximation of the optimal height. When the extended dimension is small, this approxi...

Theory Seminar: Removal Lemma For Ordered Graphs and Matrices
עומרי בן-אליעזר )אונ' תל-אביב)
יום רביעי, 17.01.2018, 12:30
טאוב 201
The triangle removal lemma, proved by Ruzsa and Szemerédi in 1976, states that if a graph contains a small number of triangles then it can be made triangle-free by a small number of edge deletions. The triangle removal lemma found applications in several areas of computer science and mathematics. In a series of works, culminating in a result of Alon and Shapira from 2005, it was shown that in fact, any hereditary graph property P satisfies a removal lemma of this type: If most subgra...

ceClub: Redesigning Bitcoin's Fee Market
רון לביא (תעשייה וניהול, טכניון)
יום רביעי, 17.01.2018, 11:30
חדר 861, בניין מאייר, הפקולטה להנדסת חשמל
The security of the Bitcoin system is based on having a large amount of computational power in the hands of honest miners. Such miners are incentivized to join the system and validate transactions by the payments issued by the protocol to anyone who creates blocks. As new bitcoins creation rate decreases (halving every 4 years), the revenue derived from transaction fees start to have an increasingly important role. We argue that Bitcoin's current fee market does not extract revenue well when blo...

למה יזמות? וצעדים ראשונים
מריוס נכט (צ'ק פוינט)
יום שלישי, 16.01.2018, 18:30
חדר 1003, בניין מאייר, הפקולטה להנדסת חשמל
מרכז היזמות בטכניון, הפקולטה להנדסת חשמל והפקולטה למדעי המחשב מזמינים אתכם להרצאת אורח של מריוס נכט, ממייסדי חברת צ'ק פוינט ויו"ר החברה, ואשר בשנים האחרונות משקיע פעיל במיזמים בתחום הביומד, כולל תרופות, מיכשור רפואי ושירותי בריאות ד...

Personalization is a Two-Way Street
Ronny Lempel - COLLOQUIUM LECTURE
יום שלישי, 16.01.2018, 14:30
Room 337 Taub Bld.
Recommender systems are first and foremost about matching users with items the systems believe will delight them. The "main street" of personalization is thus about modeling users and items, and matching per user the items predicted to best satisfy the user. This holds for both collaborative filtering and content-based methods. In content discovery engines, difficulties arise from the fact that the content users natively consume on publisher sites does not necessarily match the sponsored content...

Pixel Club: Large Scale Recovery of Scattering Media: The Atmosphere as a Case Study
עמית איידס (הנדסת חשמל, טכניון)
יום שלישי, 16.01.2018, 14:30
חדר 1061, בניין מאייר, הפקולטה להנדסת חשמל
The composition of the earth's atmosphere has a vital effect on life on earth. Accordingly, the task of monitoring its contents, i.e. aerosol and cloud concentrations, draws much interest in science and engineering. Currently, the methods employed in monitoring the atmosphere require expensive equipment, retrieve only partial data or use simplified models (e.g. horizontally uniform atmosphere). To address these shortcomings, in this thesis, we propose both a novel system and new algorithm...

Pixel Club: One-Sided Unsupervised Domain Mapping via Distance Correlations
שגיא בן-נעים (אונ' תל-אביב)
יום שלישי, 16.01.2018, 11:30
חדר 337, בניין טאוב למדעי המחשב
In unsupervised domain mapping, the learner is given two unmatched datasets A and B. The goal is to learn a mapping G_AB that translates a sample in A to the analog sample in B. Recent approaches have shown that when learning simultaneously both G_AB and the inverse mapping G_BA, convincing mappings are obtained. In this work, we present a method of learning G_AB without learning G_BA. This is done by learning a mapping that maintains the distance between a pair of samples. Moreover, good ...

Concurrent Approximate Frugal Counting
דולב אדס
יום ראשון, 14.01.2018, 13:30
Taub 601
Counting network flows’ statistics is at the heartof network monitoring, network security, and similar networkfunctionalities.Virtualization in datacenters as well as networkfunction virtualization (NFV) trends push traditional hardwareimplementations intovirtual switchesrunning as software onthe host’s CPU.The problem is that Bloom filter based datastructures for maintaining flows’ statistics such as count-minsketch and spectral Bloom filter are not optimal for softwareimplementations. Ti...

טקס הענקת מלגות לסטודנטיות מצטיינות
יום חמישי, 11.01.2018, 15:00
חדר 337, בניין טאוב למדעי המחשב
הנכם מוזמנים לטקס הענקת מלגות לסטודנטיות מצטיינות בפקולטה למדעי המחשב ולהנדסת חשמל בטכניון מטכם חברת אינטל ו-DELL-EMC. האירוע יתקיים ביום חמישי, 11 בינואר 2018, בחדר 337 (קומה שלישית) בבניין טאוב למדעי המחשב בטכניון. פרטים נוספים ותוכנית מלאה במודעה המצורפת. ...

Scalable Data Extraction Via Program Synthesis
עדי עומָרי
יום חמישי, 11.01.2018, 12:30
Taub 601
Web extraction is an important research topic that has been studied extensively, receiving a lot of attention and focus. Large amounts of data are produced and consumed online in a continuous and growing rate. The ability to collect and analyze these data has become essential for enabling a wide range of applications and improving the effectiveness of modern businesses. Web extraction methods facilitate the collection and analysis of these data by transforming the human friendly data available o...

Theory Seminar: Testing Bounded Arboricity
דנה רון (אונ' תל-אביב)
יום רביעי, 10.01.2018, 12:30
טאוב 201
In this work we consider the problem of testing whether a graph has bounded arboricity. The family of graphs with bounded arboricity includes, among others, bounded-degree graphs, all minor-closed graph classes (e.g. planar graphs, graphs with bounded treewidth) and randomly generated preferential attachment graphs. Graphs with bounded arboricity have been studied extensively in the past, in particular since for many problems they allow for much more efficient algorithms and...

ceClub: Coded Caching for Content Distribution Networks
ברק פרבמן (הנדסת חשמל, טכניון)
יום רביעי, 10.01.2018, 11:30
חדר 861, בניין מאייר, הפקולטה להנדסת חשמל
Caching is the most effective practice for reducing delays and congestion in networks aimed at content distribution. In this work we address the setup of multiple Internet service providers (ISPs) sharing a federated cache. When multiple ISPs with different demands share a cache, storage cost can be reduced when the cache is coded, that is, storing objects that are XORs of multiple content objects. The talk will present our results on low-complexity methods for coded caching, where both compu...

Computational Challenges and Algorithms in Planning for Robotic Systems
Oren Salzman - CS-Lecture
יום רביעי, 10.01.2018, 10:30
Room 644 Taub Bld.
In recent years, robots have played an active role in everyday life: medical robots assist in complex surgeries, low-cost commercial robots clean houses and fleets of robots are used to efficiently manage warehouses. A key challenge in these systems is motion planning, where we are interested in planning a collision-free path for a robot in an environment cluttered with obstacles. While the general problem has been studied for several decades now, these new applications introduce an abund...

Bridging the Gap between End-users and Knowledge Sources: Discovery, Selection and Utilization
Yael Amsterdamer - COLLOQUIUM LECTURE
יום שלישי, 09.01.2018, 14:30
Room 337 Taub Bld.
Increasingly adopted Web-based knowledge sources, such as knowledge graphs and crowdsourcing platforms, pose a great challenge in making them accessible to non-expert end-users. In particular, being unaware of the properties, structure and contents of available knowledge sources, end-users may not know which sources to use and in what manner. In this talk I will present several directions towards bridging this gap. First, we assist users in identifying adequate knowledge sources, via a de...

Pixel Club: Weakly Supervised Learning for Mammogram Classification
רמי בן-ארי (IBMׁ)
יום שלישי, 09.01.2018, 11:30
חדר 337, בניין טאוב למדעי המחשב
In several clinical routines such as mammography, the early detection of breast cancer has an enormous impact in the patient survival. Radiologists nowadays are overwhelmed by the imaging data coming from numerous screening and diagnostic tools. This puts pressure on the early detection of breast cancer has an enormous impact in the patient survival. Radiologists nowadays are overwhelmed by the imaging data coming from numerous screening and diagnostic tools. This puts pressure on the radio...

Cryptography Outside the Black Box
Omer Paneth - CS-Lecture
יום שלישי, 09.01.2018, 10:30
Room 601 Taub Bld.
Computational problems whose input is a program are central in Cryptography, as well as Complexity, Learning, and Optimization. The nature of such problems crucially depends on the way the program is accessed -- as a black box or explicitly by its implementation. In which settings can we exploit code to gain an advantage over black-box access? In Cryptography, we explore this question from two opposing perspectives: - Protecting Code: Can we obfuscate a program's code so that its functio...

Designing Robust Sensing Matrix for Compressive Sensing and a Speeding-Up Convergence Method via SESOP with Multigrid
טאו הונג
יום שני, 08.01.2018, 14:30
Taub 601
In the previous research, people tend to optimize the sensing matrix to improve the signal reconstruction accuracy for compressive sensing (CS) system. However, they assume the signal is exactly sparse which is not true in practice. So we try to find a way to design a sensing matrix which is robust to the case when the signal is not exactly sparse. Moreover, we also take the complexity of sensing a signal into account in designing the sensing matrix procedure. A novel model is proposed and an al...

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

Selective Classification for Deep Neural Networks
יונתן גייפמן
יום ראשון, 07.01.2018, 13:30
Taub 601
Selective classification techniques (also known as reject option) have not yet been considered in the context of deep neural networks (DNNs). These techniques can potentially significantly improve DNNs prediction performance by trading-off coverage. We propose a method to construct a selective classifier given a trained neural network. Our method allows a user to set a desired risk level. At test time, the classifier rejects instances as needed, to grant the desired risk (with high probability)....

Extracting Automata from Recurrent Neural Networks Using Queries and Counterexamples
גייל וייס
יום חמישי, 04.01.2018, 12:30
Taub 601
We address the problem of extracting an automaton from a trained recurrent neural network (RNN). We present a novel algorithm that uses exact learning and abstract interpretation to perform efficient extraction of a minimal automaton describing the state dynamics of a given RNN. We use Angluin's L* algorithm as a learner and the given RNN as an oracle, employing abstract interpretation of the RNN for answering equivalence queries. Our technique allows automaton-extraction from the RNN while avoi...

Evolving hardware and operating system interfaces through programmability
יום חמישי, 04.01.2018, 10:30
Room 601 Taub Bld.
Hardware and operating system interfaces should ideally enable to build performant systems that are also robust and secure. Alas, these goals frequently conflict, necessitating unavoidable compromises that promote one goal at the expense of another. I nevertheless contend that existing compromises---while inherently imperfect---are often suboptimal, and that improved tradeoffs can be devised using programmable software interfaces and hardware. I support this claim by presenting how programmabl...

איך להפסיק לפחד משינויי קוד: ניהול גרסאות עם git
מאיה אנדרסון (יבמ מחקר)
יום רביעי, 03.01.2018, 18:30
יפורסם
הנכם מוזמנים לראשון בסדרת מפגשים במסגרת בסדנה טכנית בנושאים שונים, ביום רביעי, 3 בינואר 2018, בשעה 18:30. ההרצאה הראשונה מפי מאיה אנדרסון מ-י.ב.מ מחקר: איך להפסיק לפחד משינויי קוד: ניהול גרסאות עם git ההשתתפות מחייבת הרש...

קריירה אקדמית, איך עושים זאת?
יום רביעי, 03.01.2018, 15:00
Room 337 Taub Bld.
אנו שמחים להזמין אתכם לשלישי בסדרת מפגשים בנושא קריירה וחיפוש עבודה, שייערך בפקולטה ביום רביעי, בינואר 2018, בשעה 15:00 בחדר 337, בניין טאוב למדעי המחשב. בתוכנית: 15:00 - פרופ' עירד יבנה: דברי פתיחה 15:05 - פרופ' מירי...

Theory Seminar: Locally-Iterative Coloring below Szegedy-Vishwanathan’s Barrier
מיכאל אלקין (אונ' בן-גוריון)
יום רביעי, 03.01.2018, 12:30
טאוב 201
We consider graph coloring and related problems in the distributed message-passing model. **Locally-iterative** algorithms are especially important in this setting. These are algorithms in which each vertex decides about its next color only as a function of the current colors in its 1-hop neighborhood. In STOC'93 Szegedy and Vishwanathan showed that any locally-iterative (\Delta + 1)-coloring algorithm requires Omega(\Delta \log \Delta + \log^* n) rounds, unless there exists "a very special type...

ceClub: Side Channel Attacks on Implementations of Curve25519
דניאל גנקין ויובל ירום (אונ' פנסילבניה, מרילנד ואדלייד)
יום רביעי, 03.01.2018, 11:30
חדר 861, בניין מאייר, הפקולטה להנדסת חשמל
In recent years, applications increasingly adopt security primitives designed from the start with built-in side channel protection. A concrete example is Curve25519, which has been recently standardized in RFC-7748. Dealing away with obvious leakage sources such as key-dependent branches and memory accesses, RFC-7748 dictates that implementations should use a highly regular Montgomery ladder scalar-by-point multiplication, a unified, branchless double-and-add formula and a constant-time argument...

Theory Talk: The Edited Truth
סאליט קליין (MIT)
יום שלישי, 02.01.2018, 12:30
'
We introduce two new cryptographic notions in the realm of public and symmetric key encryption. * Encryption with invisible edits is an encryption scheme with two tiers of users: “privileged” and “unprivileged”. Privileged users know a key pair (pk,sk) and “unprivileged” users know a key pair (pk_e,sk_e) which is associated with an underlying edit e to be applied to messages encrypted. When an unprivileged user attempts to decrypt a ciphertext generated by a privilege...

Pixel Club: Sparse Continuous Wavelet Transforms via a Wavelet-Plancherel Theory
רון לביא (אונ' תל-אביב)
יום שלישי, 02.01.2018, 11:30
טאוב 401
It is well known that certain classes of signals can be effectively represented using a wavelet basis or a wavelet frame, keeping only a sparse number of coefficients. For example, Shearlet (discrete) frames are optimally sparse for cartoon like images. In this talk I will extend this approach to continuous wavelet systems, which comprise a continuum of "dictionary" elements. To overcome some of the challenges in the continuous realm, I will present an extension of the standard continuous wavele...

CGGC Seminar: Two Modeling Primitives for Computer Aided Geometric Design
ג'נש מששר (מדעי המחשב, טכניון)
יום שני, 01.01.2018, 14:00
טאוב 401
Computer Aided Geometric Design concerns development of algorithms and accompanying software, towards design of parts and structures with a high degree of numerical precision. Target application domains include design of automobiles, aircrafts and buildings, among others. In this talk we discuss two kernel level modeling primitives. First, we propose a comprehensive algorithmic framework for computation of solid sweeps. This involves computing the boundary of the swept volume generat...