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

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


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

Academic Calendar at Technion site.

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

  • CGGC Seminar: Geometric Methods for Realistic Animation of Faces

    דובר:
    עמית ברמנו (פרינסטון)
    תאריך:
    יום ראשון, 30.4.2017, 13:30
    מקום:
    חדר 337, בניין טאוב למדעי המחשב

    In this talk, I will briefly introduce myself, mainly focusing on my doctoral dissertation, addressing realistic facial animation.

    Realistic facial synthesis is one of the most fundamental problems in computer graphics, and is desired in a wide variety of fields, such as film and advertising, computer games, teleconferencing, user-interface agents and avatars, and facial surgery planning.

    In the dissertation, we present the most commonly practiced facial content creation process, and contribute to the quality of each of its three steps.

    The proposed algorithms significantly increase the level of realism attained and therefore substantially reduce the amount of manual labor required for production quality facial content.

  • Coding Theory: LDPC Codes over the q-ary Multi-Bit Channel

    דובר:
    רמי כהן (מדעי המחשב, טכניון
    תאריך:
    יום ראשון, 30.4.2017, 14:30
    מקום:
    טאוב 601

    The rapid development of memory technologies has introduced challenges to the continued scaling of memory devices in density and access speed. Many of these challenges can be mitigated by coding techniques, which optimize the representation of data within these memories. In this talk, we present a practically-motivated model, where the use of novel coding frameworks improves performance. We start with introducing the class of partial-erasure channels, where the channel output is a set containing the input symbol. We focus on a channel model we term the q-ary multi-bit channel, which models errors with graded levels of severity (common in non-volatile memories). Our results include asymptotic and finite-length iterative-decoding analysis and code design and maximum-likelihood decoding analysis of GF(q) low-density parity-check (LDPC) codes.

  • Distributed construction of graph spanners

    דובר:
    עמי פז, הרצאה סמינריונית לדוקטורט
    תאריך:
    יום רביעי, 3.5.2017, 12:30
    מקום:
    טאוב 201
    מנחה:
    Prof. Keren Censor-Hillel

    A spanner of a given graph is a sparse subgraph that approximately preserves distances. Since their introduction in the late 1980's, spanners have found numerous applications in synchronization problems, information dissemination, routing schemes and more. Many applications of spanners are in computer networks, where the network needs to find a spanner for its own communication graph. We present distributed algorithms for constructing additive spanners in networks of bounded message size, namely in the CONGEST model. In addition, we present an innovative technique for showing lower bounds for constructing spanners in this setting, a technique that can be useful for other distributed graph problems. This is a part of my phd work, which concentrates on computing distances in distributed systems. Based on joint works with Keren Censor-Hillel, Telikepalli Kavitha, Noam Ravid and Amir Yehudayoff

  • סדנת המרכז להנדסת מחשבים ע"ש סטפן ושרון זיידן 2017

    TCE Workshop: 2017 Stephen and Sharon Seiden Frontiers in Engineering and Science

    תאריך:
    יום שישי, 5.5.2017, 09:30
    מקום:
    המרכז להנדסת מחשבים,טכניון

    הנכם מוזמנים לסדנת המרכז להנדסת מחשבים ע"ש סטפן ושרון זיידן 2017 של המרכז להנדסת מחשבים בנושא:
    "Beyond CMOS: From Devices to Systems" אשר תתקיים בימים שני-שלישי, 5-6 ביוני, 2017 בטכניון.
    ההרשמה תיפתח ב-15 במרס, 2017, ופרטים נוספים בדף האנגלי ובאתר הסדנה.

  • CSpecial Guest: Design by Introspection

    דובר:
    אנדרי אלכסנדרסקו
    תאריך:
    יום שלישי, 9.5.2017, 11:00
    מקום:
    חדר 337, בניין טאוב למדעי המחשב

    Over the years, a few programming paradigms have been successful enough to enter the casual vocabulary of software engineers: procedural, imperative, object-oriented, functional, generic, declarative. There's a B-list, too, that includes paradigms such as logic, constraint-oriented, and symbolic. The point is, there aren't very many of them altogether. Easy to imagine, then, the immensely humbling pressure one must feel when stumbling upon a way to think about writing code that is at the same time explosively productive and firmly removed from any of the paradigms considered canon. This talk shares early experience with Design by Introspection, a proposed programming paradigm that has enough demonstrable results to be worth sharing. The tenets of Design by Introspection are:

    * The rule of optionality: Component primitives are almost entirely opt-in. A given component is required to implement only a modicum of primitives, and all others are optional. The component is free to implement any subset of the optional primitives.

    * The rule of introspection: A component user employs introspection on the component to implement its own functionality using the primitives offered by the component.

    * The rule of elastic composition: a component obtained by composing several other components offers capabilities in proportion with the capabilities offered by its individual components.

    These rules, and how to use them to build powerful software, are the topic of this talk.

  • Communication-efficient Algorithms for Distributed Stream Mining

    דובר:
    משה גבל, הרצאה סמינריונית לדוקטורט
    תאריך:
    יום רביעי, 10.5.2017, 13:00
    מקום:
    טאוב 601
    מנחה:
    Prof. A. Schuster, Prof. D. Keren

    Recent years has seen an explosion in the number of connected devices, which means not only growth in velocity and volume of data, but also that data sources are increasingly geographically distributed, raising cost of communication. Data mining algorithms often assume that data is centralized or that communication is inexpensive: the setting is implicitly assumed to be a data center. In settings like wireless sensor networks, however, communication costs battery power. Moreover, most work only considers one-shot computation: computing a result once from a fixed data set. Yet data is increasingly dynamic, and many applications need current results over a recent time window. In this talk, we focus on computing approximations over aggregated distributed data streams with reduced communication. Using a safe zone framework developed in our group (also called geometric monitoring), we'll describe three novel distributed approximations for important non-linear functions: variance, least-squares regression, and Shannon's entropy. Our algorithms provide deterministic user-defined error bounds, while avoiding messages unless needed to maintain those bounds. Compared to the centralized solution, our algorithms reduce communication by up to two orders of magnitude on several real data sets, including machine health monitoring, network monitoring with netflows, traffic monitoring, and others.

  • Quantum computation: A computational lens on quantum physics

    דובר:
    Dorit Aharonov - COLLOQUIUM LECTURE
    תאריך:
    יום שלישי, 16.5.2017, 14:30
    מקום:
    חדר 337 טאוב.
    השתייכות:
    Hebrew University, Dept. of Computer Science and Engineering
    מארח:
    Yuval Filmus
  • How to find cryptographic needles in exponentially large haystacks

    דובר:
    Adi Shamir - COLLOQUIUM LECTURE
    תאריך:
    יום שלישי, 6.6.2017, 14:30
    מקום:
    חדר 337 טאוב.
    השתייכות:
    Weizmann Institute
    מארח:
    Yuval Filmus

    T B A

  • יום עיון בקריפטולוגיה 2017

    CRYPTODAY 2017

    תאריך:
    יום חמישי, 15.6.2017, 09:00
    מקום:
    אודיטוריום 1 בניין טאוב למדעי המחשב

    יום העיון בקריפטולוגיה 2017 יתקיים ביום חמישי, 15 ביוני 2017, בין השעות 17.15-9.00, באודיטוריום 1, בניין טאוב למדעי המחשב, הטכניון.

    רוב ההרצאות יינתנו בעברית ובהן הרצאתו של דר' מארק סטיבנס על עבודתו החדשה אשר חשפה התנגשות של SHA-1. הרצאות נוספות יעסקו במטבעות וירטואליות, blockchains ועוד.

    פרטים נוספים ותוכנית, כולל תקצירי הרצאות, הרשמה (ללא תשלום אך נדרשת) והוראות הגעה.

    כולם מוזמנים!

  • Effective deductive verification of safety of distributed protocols in unbounded systems

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

    T B A