קולוקוויום וסמינרים

כדי להצטרף לרשימת תפוצה של קולוקוויום מדעי המחשב, אנא בקר בדף מנויים של הרשימה.


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

Academic Calendar at Technion site.

קולוקוויום וסמינרים בקרוב

  • CGGC Seminar: Generalized Volumetric Foliation from Inverted Viscous Flow

    דובר:
    דוד כהן (מדעי המחשב, טכניון)
    תאריך:
    יום ראשון, 28.4.2019, 11:00
    מקום:
    טאוב 401

    We propose a controllable geometric flow that decomposes the interior volume of a triangular mesh into a collection of encapsulating layers, which we denote by a generalized foliation. For star-like genus zero surfaces we show that our formulation leads to a foliation of the volume with leaves that are closed genus zero surfaces, where the inner most leaves are spherical. Our method is based on the three-dimensional Hele-Shaw free-surface injection flow, which is applied to a conformally inverted domain. Every time iteration of the flow leads to a new free surface, which, after inversion, forms a foliation leaf of the input domain. Our approach is simple to implement, and versatile, as different foliations can be generated by modifying the injection point of the flow. We demonstrate the applicability of our method on a variety of shapes, including high-genus surfaces and collections of semantically similar shapes.

  • Effective Enumeration of Tree Decompositions for Solver Optimization

    דובר:
    דביר דוכן, הרצאה סמינריונית למגיסטר
    תאריך:
    יום ראשון, 28.4.2019, 11:00
    מקום:
    טאוב 601
    מנחה:
    Prof. Benny Kimelfeld

    Many intractable computational problems on graphs admit tractable algorithms when applied to trees or forests. In such cases, a tree decomposition of the input graph often facilitates an effective solution. Therefore, tree decompositions are critical for graph problems in the fields of databases, game theory, statistical analysis, bioinformatics and more. The goal of this research is to build an efficient tool for enumerating (producing) a large space of tree decompositions for solvers of graph problems to select from. While the research is practical, it is relying on a recent theoretical development on the complexity of this problem. We have conducted the research in three main steps: First, we have investigated and improved an existing algorithm in order to enhance its runtime performance of a single-thread execution. Then, we have developed parallelized versions of the algorithm, while retaining its formal guarantees. Lastly, we tested the usability of the algorithm in a recent framework that learns the effectiveness of a tree decomposition on different graph problems.

  • Generalized Volumetric Foliation from Inverted Viscous Flow

    דובר:
    David Cohen, הרצאה סמינריונית למגיסטר
    תאריך:
    יום ראשון, 28.4.2019, 14:00
    מקום:
    טאוב 401
    מנחה:
    Prof. M. Ben-Chen

    We propose a controllable geometric flow that decomposes the interior volume of a triangular mesh into a collection of encapsulating layers, which we denote by a generalized foliation. For star-like genus zero surfaces we show that our formulation leads to a foliation of the volume with leaves that are closed genus zero surfaces, where the inner most leaves are spherical. Our method is based on the three-dimensional Hele-Shaw free-surface injection flow, which is applied to a conformally inverted domain. Every time iteration of the flow leads to a new free surface, which, after inversion, forms a foliation leaf of the input domain. Our approach is simple to implement, and versatile, as different foliations can be generated by modifying the injection point of the flow. We demonstrate the applicability of our method on a variety of shapes, including high-genus surfaces and collections of semantically similar shapes.

  • Deep Eikonal Solvers

    דובר:
    משה ליכטנשטיין, הרצאה סמינריונית למגיסטר
    תאריך:
    יום שני, 29.4.2019, 11:00
    מקום:
    טאוב 601
    מנחה:
    Prof. Ron Kimmel

    A deep learning approach to numerically approximate the solution to the Eikonal equation is introduced. The proposed method is built on the fast marching scheme which comprises of two components: a local numerical solver and an update scheme. We replace the formulaic local numerical solver with a trained neural network to provide highly accurate estimates of local distances for a variety of different geometries and sampling conditions. Our learning approach generalizes not only to flat Euclidean domains but also to curved surfaces enabled by the incorporation of certain invariant features in the neural network architecture. We show a considerable gain in performance, validated by smaller errors and higher orders of accuracy for the numerical solutions of the Eikonal equation computed on different surfaces. The proposed approach leverages the approximation power of neural networks to enhance the performance of numerical algorithms, thereby, connecting the somewhat disparate themes of numerical geometry and learning.

  • Computer Agents that Interact Proficiently with People

    דובר:
    Sarit Kraus - COLLOQUIUM LECTURE
    תאריך:
    יום שלישי, 30.4.2019, 14:30
    מקום:
    חדר 337 טאוב.
    השתייכות:
    Bar-Ilan University
    מארח:
    Yuval Filmus

    Automated agents that interact proficiently with people can be useful in supporting, training or replacing people in complex tasks. The inclusion of people presents novel problems for the design of automated agents’ strategies. People do not necessarily adhere to the optimal, monolithic strategies that can be derived analytically. Their behavior is affected by a multitude of social and psychological factors. In this talk I will show how combining machine learning techniques for human modelling, human behavioral models, formal decision-making and game theory approaches enables agents to interact well with people. Applications include intelligent agents that help drivers reduce energy consumption, agents that support rehabilitation, employer-employee negotiation and agents that support a human operator in managing a team of low-cost mobile robots in search and rescue tasks. Short Bio: =========== Sarit Kraus (Ph.D. Computer Science, Hebrew University, 1989) is a Professor of Computer Science at Bar-Ilan University. Her research is focused on intelligent agents and multi-agent systems (including people and robots). Kraus was awarded the IJCAI Computers and Thought Award, ACM SIGART Agents Research award, the EMET prize and was twice the winner of the IFAAMAS influential paper award. She is AAAI, ECCAI and ACM fellow and a recipient of the advanced ERC grant.

  • פצח את קוד הראיון שלך

    CSpecial Talk: Crush Your Coding Interview

    דובר:
    דור גרוס (פייסבוק ישראל)
    תאריך:
    יום רביעי, 1.5.2019, 12:30
    מקום:
    טאוב 7

    אנו שמחים להזמין אתכם לרביעי בסדרת מפגשים בנושא קריירה וחיפוש עבודה שיתקיים ביום רביעי, 1 במאי 2019, בשעה 12:30 בכיתה 7, בניין טאוב למדעי המחשב.

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

  • Some systems engineering problems and a little bit of theory

    דובר:
    Eitan Bachmat - COLLOQUIUM LECTURE - RESCHEDULED
    תאריך:
    יום שלישי, 14.5.2019, 14:30
    מקום:
    חדר 337 טאוב.
    השתייכות:
    Ben-Gurion University
    מארח:
    Yuval Filmus

    We will consider the SITA server farm scheduling policies which were introduced and studied by Harchol-Balter and her collaborators. In particular we will discuss a recent INFOCOM17 paper of Doncel, Aalto and Ayesta and relate one of the tables there to the work of Riemann on the functional equation of the zeta function. We will also consider certain disk drive scheduling problems (travelling salesman on a disk drive) and then relate it to space-time geometry and in particular to gravitational lensing for positive mass particles. Finally we will relate, via airplane boarding, the disk scheduling problem with server farm scheduling. Short Bio: ========== Eitan Bachmat received his PhD in mathematics from M.I.T. and is currently a professor of computer science at Ben-Gurion University. Eitan works on problems in the areas of Storage Systems, Performance analysis, Systems engineering, Operations research, Autism, Personalized Medicine and Digital healthcare, using techniques from Physics, Mathematics and Computer Science. He is an expert on airplane boarding and express line queues and how they relate to relativity theory and number theory respectively. Eitan also works closely with industry and various organizations on diverse applications and holds 38 patents. ========================== Refreshments will be served from 14:15 Lecture starts at 14:30

  • תאריך:
    מקום:
  • On Optimization and Generalization in Deep Learning

    דובר:
    Amir Globerson - COLLOQUIUM LECTURE
    תאריך:
    יום שלישי, 4.6.2019, 14:30
    מקום:
    חדר 337 טאוב.
    השתייכות:
    Tel-Aviv University
    מארח:
    Yuval Filmus

    TBA

  • SYNTECH: Synthesis Technologies for Reactive Systems Software Engineers

    דובר:
    Shahar Maoz - COLLOQUIUM LECTURE
    תאריך:
    יום שלישי, 11.6.2019, 14:30
    מקום:
    חדר 337 טאוב.
    השתייכות:
    School of Computer Science, Tel-Aviv University
    מארח:
    Yuval Filmus

    T B A Shahar Maoz research interests are in Software Engineering, specifically software and systems modeling, modeling languages, and formal methods. He has recently worked on synthesis of structure and behavior, differencing, and log analysis. He joined the faculty of the School of Computer Science, Tel Aviv University, in summer 2012, as a (tenure-track) Senior Lecturer (assistant professor). Since January 2018 he is an Associate Professor with Tenure. He received his B.Sc and M.Sc. in Computer Science from Tel Aviv University and his PhD in Computer Science from the Weizmann Institute (2009). Before joining TAU as a faculty member he was post-doc research fellow at RWTH Aachen University, Germany (2010-2012). In 2015-2016 he was on sabbatical as visiting scientist at MIT CSAIL.