Colloquia and Seminars

To join the email distribution list of the cs colloquia, please visit the list subscription page.


Computer Science events calendar in HTTP ICS format for of Google calendars, and for Outlook.

Academic Calendar at Technion site.

Upcoming Colloquia & Seminars

  • Two Researches on Lattice Animals

    Speaker:
    Yufei Zheng, M.Sc. Thesis Seminar
    Date:
    Sunday, 22.4.2018, 13:30
    Place:
    Taub 301
    Advisor:
    Prof. Gill Barequet

    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 the talk, we derive a set of formulae of $B(n,k,d)$ for small values of $k$. Moreover, we show that for fixed defect $k$, the generating function of the enumerating sequence $(B(n,k,d))$ is rational. This inevitably sheds some light on the long-standing open problem of counting polyominoes and polycubes. The second part of the talk is dedicated to the lower bound on the growth constant of polyiamonds. We provide an improved lower bound using concatenation argument. A further improvement is also suggested, though based on an unproven yet highly plausible assumption.

    This research was performed under the supervision of Prof. Gill Barequet.

  • The Information Era: Past, Present and Future Conference

    The Information Era: Past, Present and Future Conference

    Date:
    Tuesday, 24.4.2018, 09:00
    Place:
    CS Taub Auditorium 2

    CS is happy to invite you to The Marconi Society conference: "The Information Era: Past, Present and Future", on Tuesday, April 24th, 2018 in Taub Auditorium 2.

    Guest of honor will be Prof. Andrew Viterbi, one of Qualcomm founders, who will take part in a historic panel with Prof. Jacob Ziv and Prof. Abraham Lempel, in celebration of 70 years of information and communication.

    The conference is in cooperation with Marconi Society, Haifa Municipality and the Technion Electrical Engineering Department.

    Participation is free but requires pre-registration.

    More details and program.

  • Pixel Club: On GANs and GMMs

    Speaker:
    Eitan Richardson (Hebrew University of Jerusalem)
    Date:
    Tuesday, 24.4.2018, 11:30
    Place:
    Room 337 Taub Bld.

    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 and hard to train GAN, we learn a Gaussian Mixture Model and demonstrate on several datasets that it manages to model the distribution of full images and generate realistic samples. Finally, we discuss how our model can be paired with a pix2pix network to add high-resolution details while maintaining the basic diversity.

  • 1+1=3: Combining Object Storage with Other Data Services

    Speaker:
    Michael Factor - COLLOQUIUM LECTURE
    Date:
    Tuesday, 24.4.2018, 14:30
    Place:
    Room 337 Taub Bld.
    Affiliation:
    IBM Research - Haifa
    Host:
    Yuval Filmus

    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. In particular, we will describe the differences between object storage and more traditional big data storage solution. Motivated by a real application scenario, we will then discuss some innovative, high performance, integrations between object storage and other services such as Apache Spark or Apache Kafka, showing how the sum total is greater than the parts and enabling getting value from data.
    Short Bio:
    =========
    Dr Factor is an IBM Fellow with a focus on cloud data, storage and systems. He has a B.Sc., Valedictorian (1984) in Computer Science from Union College, Schenectady, NY. M.Sc. (1988), M.Phil. (1989) and Ph.D. (1990) in Computer Science from Yale University. Since graduating, Dr. Factor has worked at the IBM Research -- Haifa.
    His current main focus area is cloud data and storage where he is leading IBM in integrating cloud data services. He takes a leading role in cloud-related research in his lab including topics such as cloud data stores and their ecosystem, data infrastructure support for analytics, data organzation, data security and governance, next generation storage systems, and cloud delivery of data stores. In the past, he worked on archiving and long term digital preservation, storage power, advanced storage functions and storage system architectures, where he was an architect of advanced copy functions for IBM's DS family of storage subsystems. Prior to that, Dr. Factor was the manager of Distributed and Clustered Systems in HRL. Other areas where Dr. Factor has worked include the cluster VM for Java, the XML File System, the IBM iSeries Integrated File System and the Web server for the 1996 Atlanta Olympics.
    Dr. Factor was a past chair of the SYSTORsteering committee and was the program committee co-chair for both SYSTOR 2009 and MSST2010: Research Track and has served on numerous program committees.
    Dr. Factor also worked with Prof. Dan Tsafrir and Prof Assaf Schuster to co-advise students at the Technion, Israel Institute of Technology. Prior students include Gala Yadgar, who works on Karma, Multilevel Cache Management Based on Application Hints and Konstantin Shagin, who worked on JavaSplit, Fault Tolerant High-Performance Parallel Computing with Java.
     

  • CS Open Day For Graduate Studies

    CS Open Day For Graduate Studies

    Date:
    Wednesday, 25.4.2018, 12:15
    Place:
    Room 337 Taub Bld.

    The 2018 open day invites outstanding undergraduates from all universities to come to the Technion and learn about the Computer Science and Department, to meet faculty and graduate students and to hear a fascinating talk by Moshe Levinger, Senior Manager in IBM Haifa: "Do Advanced Degrees Indeed Advance?"

    The event will be held on Wednesday, April 25 2018, between 12:15-15:00, in CS Taub Building, room 337 (3rd floor).

    The program will include review on curriculum and admission requirements, as well as scientific lectures. In addition, personal meeting between candidates and vice deans of both faculties will be optional.

    Attendance at the open day requires pre-registration.

    More details and program.

  • On Graph Learning

    Speaker:
    Hassan Abassie, Ph.D. Thesis Seminar
    Date:
    Thursday, 26.4.2018, 11:00
    Place:
    Taub 701
    Advisor:
    Prof. Nader H. Bshouty

    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 hypergraph (where each edge consists of two vertices or more). The motivation behind studying some graph families relevant to the problem above, was its various applications in different areas such molecular biology, chemistry and networks. For example, the general graph case is motivated by problems from biology and chemistry where, given a set of molecules (chemicals), we need to find pairs that react with each other. In this case, the vertices correspond to the molecules (chemicals), the edges to the reactions, and the queries to experiments of putting a set of molecules (chemicals) together in a test tube and determining whether a reaction occurs. When multiple molecules (chemicals) are combined in one test tube, a reaction is detectable if and only if at least one pair of the molecules (chemicals) in the tube reacts. The task is to identify which pairs react using as few experiments as possible. In this talk I will show that any non-adaptive Monte Carlo algorithm (one-round) must ask at least $\Omega(m^2\log n)$ queries, and any two-round deterministic algorithm must ask at least $\Omega(m^2\log n)$ queries. Finally, I will show a two-round Monte Carlo algorithm that asks $O(m^{4/3}\log n)$ queries and a five-round deterministic algorithm that asks $O(m^2\log n)$ queries.

  • EUROCRYPT 2018

    EUROCRYPT 2018

    Date:
    Sunday, 29.4.2018, 18:00
    Place:
    Tel-Aviv

    EUROCRYPT 2018 is the 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques. Covering all aspects of cryptology, including theoretical foundations, deployment of cryptographic schemes, cryptanalysis of widely used standards, cryptographic protocols, quantum cryptography, and cryptographic currencies.

    This year's edition will take place in Tel Aviv, Israel on April 29-May 3 2018. EUROCRYPT 2018 is one of the flagship conferences of the the International Association for Cryptologic Research (IACR), and is organized by the Technion Hiroshi Fujiwara Cyber Security Research Center.

    More details will be announced soon.

  • CSpecial Talk: Crush Your Coding Interview

    CSpecial Talk: Crush Your Coding Interview

    Speaker:
    David Gross (Facebook Israel)
    Date:
    Monday, 30.4.2018, 17:00
    Place:
    Room 337 Taub Bld.

    We are happy to invite your to the fourth of series of meetings on career and job seeking which will be held at CS, on Monay, April 30, at 17:00, in room 337, CS Taub Building.

    Mr. David Gross, Program Engineer in Facebook Israel will give a talk on how to prepare and succeed in a technical interview: "Crush Your Coding Interview".

    Please pre-register.

    See you there!

  • Template Matching with Deformable Diversity Similarity

    Speaker:
    Itamar Talmi, M.Sc. Thesis Seminar
    Date:
    Tuesday, 1.5.2018, 11:30
    Place:
    Taub 337
    Advisor:
    Prof. L. Zelnik-Manor

    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 method outperforms the current state-of-the-art in its detection accuracy while improving computational complexity.

  • Genetics media

    Speaker:
    Yaniv Erlich - COLLOQUIUM LECTURE - RESCHEDULED FROM 10/4/18
    Date:
    Tuesday, 1.5.2018, 14:30
    Place:
    Room 337 Taub Bld.
    Affiliation:
    Computer Science, Columbia University and Chief Science Officer, MyHeritage
    Host:
    Yuval Filmus

    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 family tree of 13 million people. Using this data, we analyzed the genetic architecture of longevity. I will also speak about our on-going efforts to crowd source genomes and social media phenotypes to this massive pedigree. In the second part of my talk, I will present using synthetic DNA as a medium for long-term data storage. Previous studies in leading journal have presented this concept but failed to show reliable data retrieval. Here, we report a storage strategy, called DNA Fountain, that is highly robust and approaches the Shannon limit. The success of our strategy relies on careful adaptation of coding theory to the domain-specific constraints of DNA molecules. To demonstrate its power, we stored a full computer operating system, movie, and other files in DNA oligos and perfectly retrieved the information. We explored the limit of our architecture in terms of bytes per molecules and obtained a perfect retrieval from a density of 215Petabyte/gram of DNA, orders of magnitudes higher than previous techniques. Short Bio: ========== Dr. Yaniv Erlich is the Chief Science Officer of MyHeritage.com and an Associate Professor of Computer Science and Computational Biology at Columbia University (leave of absence). Prior to these positions, he was a Fellow at the Whitehead Institute, MIT, where he ran his own lab. Dr. Erlich received his bachelor's degree from Tel-Aviv University, Israel (2006) and a PhD from the Watson School of Biological Sciences at Cold Spring Harbor Laboratory (2010). Dr. Erlich's research interests are computational human genetics. Dr. Erlich is the recipient of DARPA's Young Faculty Award (2017), the Burroughs Wellcome Career Award (2013), Harold M. Weintraub award (2010), the IEEE/ACM-CS HPC award (2008), and he was selected as one of 2010 Tomorrow's PIs team of Genome Technology. ==================================== Refreshments will be served from 14:15 Lecture starts at 14:30

  • CS Spring Hackathon

    CS Spring Hackathon

    Date:
    Thursday, 3.5.2018, 09:00
    Place:
    CS Taub

    CS invites you to assemble a winning team and start working on a brilliant idea for the Spring Hackaton that will take place on Thursday-Friday, May 3-4, 2018 in CS Taub Building.

    The program will include 24 hour team work, supervised by leading tutors, refreshments and pecuniary rewards (first place will win 5,000 NIS).

    Please pre-register by April 15th, seats are limited.

    See you there!

  • CGGC Seminar: Rigid Motions on 3D Digital Space

    Speaker:
    Kacper Pluta (CS, Paris-Est Marne-la-Vallée University, France)
    Date:
    Sunday, 13.5.2018, 13:30
    Place:
    Room 337 Taub Bld.

    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 not preserve distances, furthermore bijectivity and point connectivity are generally lost.

    In the context of digitized rigid motions on the 3D integer lattice we first focus on the open problem of determining whether a 3D digitized rotation is bijective. In our approach, we explore arithmetic properties of Lipschitz quaternions. This leads to an algorithm which answers the question whether a given digitized rotation—related to a Lipschitz quaternion—is bijective. Finally, we study at a local scale geometric and topological defects induced by digitized rigid motions. Such an analysis consists of generating all the images of a finite digital set under digitized rigid motions. This problem amounts to computing an arrangement of hypersurfaces in a 6D parameter space. The dimensionality makes the problem practically unsolvable for state-of-the-art techniques such as cylindrical algebraic decomposition. We propose an ad hoc solution, which mainly relies on parameter uncoupling, and an algorithm for computing sample points of 3D connected components in an arrangement of second degree polynomials.

  • Ballpark Crowdsourcing

    Speaker:
    Dafna Shahaf
    Date:
    Tuesday, 29.5.2018, 14:30
    Place:
    Room 337 Taub Bld.
    Affiliation:
    Computer Science, Hebrew University
    Host:
    Yuval Filmus
  • Qubit 2018 - Quantum Communication: Celebrating Bennett & Brassard's Wolf Prize for Physics

    Date:
    Sunday, 3.6.2018, 09:30
    Place:
    CS Taub Building

    The Technion Hiroshi Fujiwara Cyber Security Research Center is happy to invite you to save the date for the Qubit 2018 - Quantum Communication: Celebrating Bennett & Brassard's Wolf Prize for Physics conference to be held on Sunday, June 3rd, 2018 at the Taub CS Building, Technion.

    Confirmed Speakers will be:

    Charles Bennett, IBM Research Center:
    "Why DIY Randomness is Better Than DI Randomness"

    Gilles Brassard, Université de Montréal:
    "Cryptography In A Quantum World"

     Lev Vaidman, Tel-Aviv University:
    "Counterfactual Communication"

    Tal Mor, Technion:
    "Quantum Computers - Is The Future Here?"

    Participating is free but requires pre-registration, to be opened in May 1, 2018

    More details and full program will follow soon.

  • Matching Visual Data

    Speaker:
    Shai Avidan - COLLOQUIUM LECTURE
    Date:
    Tuesday, 5.6.2018, 14:30
    Place:
    Room 337 Taub Bld.
    Affiliation:
    Faculty of Engineering, Tel-Aviv University
    Host:
    Yuval Filmus
  • Privacy, and Why You Should Care

    Speaker:
    Katrina Ligett - COLLOQUIUM LECTURE
    Date:
    Tuesday, 12.6.2018, 14:30
    Place:
    Room 337 Taub Bld.
    Affiliation:
    Hebrew University
    Host:
    Yuval Filmus
  • Core-sets for Nano-Drones, Provable Big/Deep Data Learning

    Speaker:
    Dan Feldman
    Date:
    Tuesday, 26.6.2018, 14:30
    Place:
    Room 337 Taub Bld.
    Affiliation:
    Computer Science Dept., Haifa University
    Host:
    Yuval Filmus

    T B A