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

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


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

Academic Calendar at Technion site.

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

  • Theory Seminar: Public Randomness, Blockchains and Proofs-of-delay

    דובר:
    ג'וסף בונו (אונ' סטנפורד)
    תאריך:
    יום ראשון, 26.2.2017, 11:30
    מקום:
    טאוב 401

    A public, unpredictable source of randomness would enable many exciting applications, starting with verifiable public lotteries. It is an essential building block for many types of smart contract requiring random inputs, from online games to random audits. This talk will define this important fundamental problem and describe potentially solutions using proof-of-work based blockchains. The problem appears to require a new cryptographic primitive, the proof-of-delay: a deterministic, inherently sequential, pseudorandom function with compact, easily-verifiable proofs of correctness. Several approaches to constructing a proof-of-delay will be proposed.

  • Efficiently Enumerating Tree Decompositions

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

    Many intractable problems on graphs, can be efficiently solved for trees or forests. Tree decompositions allow taking advantage of this fact to handle general graphs by grouping nodes into bags and extracting a tree structure. The problem at hand is then solved independently for the subgraphs induced by the bags, and then the results can be efficiently combined. Tree decompositions have a plethora of applications, including join optimization in databases, constraint-satisfaction problems, and inference in probabilistic graphical models. Unfortunately, finding a good tree decomposition is not an easy task. We explore the approach of generating many (or all) tree decompostions, and choosing the best. Our proposed enumeration algorithm runs in incremental polynomial time (the delay after the Nth answer is polynomial in N+n, where n is the size of the input). It also enumerates the minimal triangulations of a graph, and can incorporate any method for (ordinary, single result) triangulation or tree decomposition, serving as an anytime algorithm to improve such a method. I will describe the algorithm along with an experimental study of an implementation on real graphs of two kinds: database queries and Bayesian networks. Our experiments show that the algorithm improves upon central quality measures over the underlying tree decompositions, and is able to produce a large number of high-quality decompositions. The presentation will be given in English, no prior knowledge is assumed.

  • Pixel Club: Perceptual Representation Learning Across Diverse Modalities and Domains

    דובר:
    טרבור דארל (ברקלי)
    תאריך:
    יום שלישי, 28.2.2017, 14:30
    מקום:
    חדר 1003, בניין מאייר, הפקולטה להנדסת חשמל

    Learning of layered or "deep" representations has provided significant advances in computer vision in recent years, but has traditionally been limited to fully sup​​ervised settings with very large amounts of training data. New results show that such methods can also excel when learning in sparse/weakly labeled settings across modalities and domains. I'll review state-of-the-art models for fully convolutional pixel-dense segmentation from weakly labeled input, and will discuss new methods for adapting deep recognition models to new domains with few or no target labels for categories of interest. As time permits, I'll present recent long-term recurrent network models can learn cross-modal description and explanation

    Short Bio:
    Prof. Darrell is on the faculty of the CS Division of the EECS Department at UC Berkeley. He leads Berkeley’s DeepDrive Industrial Consortia, is co-Director of the Berkeley Artificial​ ​Intelligence Research (BAIR) lab, and is Faculty Director of PATH at UC Berkeley. Darrell’s group develops algorithms for large-scale perceptual learning, including object and activity recognition and detection, for a variety of applications including multimodal interaction with robots and mobile devices. His interests include computer vision, machine learning, natural language processing, and perception-based human computer interfaces. Prof. Darrell previously led the vision group at the International Computer Science Institute in Berkeley, and was on the faculty of the MIT EECS department from 1999-2008, where he directed the Vision Interface Group. He was a member of the research staff at Interval Research Corporation from 1996-1999, and received the S.M., and PhD. degrees from MIT in 1992 and 1996, respectively. He obtained the B.S.E. degree from the University of Pennsylvania in 1988.

  • CGGC Seminar: Solving Piecewise Polynomial Constraint Systems with Decomposition using Subdivision-Based Solver

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

    Piecewise polynomial constraint systems are common in numerous problems in computational geometry, such as constraint programming, modeling, and kinematics.

    In this talk, we present a framework that is capable of decomposing, and efficiently

    solving a wide variety of complex piecewise polynomial constraint systems.

    The framework we present uses a constraint system decomposition algorithm to break down complex problems into smaller, simpler subproblems. It then solves the subproblems using a subdivision-based polynomial solver and propagates the results from one subproblem to the next using multivariate functional composition.

    Our framework supports problems with either zero-dimensional or univariate solution spaces, and also include both zero constraints and inequality constraints.

    We will demonstrate the capabilities of our framework on several problems, from simple "point-and-bar" systems through complex kinematic problems to general algebraic problems and compare its performance to the subdivision-based polynomial solver without decomposition.

  • CGGC Seminar: Geometric Methods for Realistic Animation of Faces

    דובר:
    עמית ברמנו (פרינסטון)
    תאריך:
    יום שבת, 15.4.2017, 13:00
    מקום:
    חדר 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.

  • סדנת המרכז להנדסת מחשבים ע"ש סטפן ושרון זיידן 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, ופרטים נוספים בדף האנגלי ובאתר הסדנה.