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

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


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

Academic Calendar at Technion site.

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

  • Secure Computation in Hostile Environments

    דובר:
    דניאל גנקין, הרצאה סמינריונית לדוקטורט
    תאריך:
    יום ראשון, 8.5.2016, 11:00
    מקום:
    טאוב 601
    מנחה:
    Prof. Yuval Ishai and Dr. Eran Tromer

    The ubiquitous nature of computer systems means that they often operate in hostile environments where they are subjected to various attacks by adversarial parties. The purpose of such attacks varies, ranging from simply corrupting the system's behaviour to a complete extraction of otherwise-unavailable secret information. My research explores theoretical and practical aspects of designing computer systems which can securely operate in hostile environments. In the talk I will describe two aspects of my research: 1. The vulnerability of computer systems to side-channel attacks designed to extract externally-unavailable secret information. 2. The design of secure multiparty computation protocols which guarantee the security of distributed computations even in the presence on an active adversary. Our protocols are based novel techniques for designing circuits resilient to specific types of attacks, which might be of independent interest. The talk will include live and edible demonstrations.

  • CGGC Seminar: Regularized Harmonic Map Flow: a Tool for Improvement of Maps between Shapes

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

    The problem of computing shape correspondence is a fundamental task in Computer Graphics. While recent methods produce semantically meaningful maps globally, the maps are distorted locally.

    The harmonic map heat flow is a tool for local minimization of the Dirichlet energy, that measures the smoothness of a map. While the discrete harmonic map flow has been used, for example, to conformally map shapes to a sphere, when the target shape is arbitrary applying this flow can have a negative effect globally.

    We suggest a regularization of this flow, using geodesic directions and additional extrinsic normals information, that produces smoother maps that remain globally meaningful.

    This tool can be extremely beneficial for texture transfer and reducing distortion of ground-truth correspondence.

  • Coding Theory: Generalized Notion of Graph Capacity

    דובר:
    עופר שייביץ (אונ' תל-אביב)
    תאריך:
    יום ראשון, 8.5.2016, 14:30
    מקום:
    טאוב 601

    Motivated by the problem of zero-error communication over a broadcast channel, we introduce a new notion of graph capacity that generalizes the Shannon capacity of a graph. We derive upper and lower bounds on this quantity for arbitrary graphs, and provide a tighter upper bound for regular graphs.Joint work with Sihuang Hu.

  • שלב הגמר - תחרות אמדוקס לפרוייקט המצטיין 2015-16

    The Finals - 2015-16 Amdocs Best Project Contest

    תאריך:
    יום ראשון, 8.5.2016, 14:30
    מקום:
    אודיטוריום 2 בניין טאוב למדעי המחשב

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

    האירוע יתקיים ביום ראשון', 8 במאי 2016, בין השעות 14:30-16:30, באודיטוריום טאוב 2, בניין טאוב למדעי המחשב

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

  • Unsupervised Ensemble Learning

    דובר:
    Boaz Nadler - COLLOQUIUM LECTURE
    תאריך:
    יום שלישי, 10.5.2016, 14:30
    מקום:
    חדר 337-8 טאוב.
    קישור:
    http://www.cs.technion.ac.il/~colloq/20160510_14_30_Nadler.html
  • Subspace codes and distributed storage codes.

    דובר:
    נתנאל רביב, הרצאה סמינריונית לדוקטורט
    תאריך:
    יום ראשון, 15.5.2016, 16:30
    מקום:
    טאוב 601
    מנחה:
    Prof. Tuvi Etzion.

    The interest in subspace codes has increased lately due to their application in error correction for random network coding. A subspace code is a collection of subspaces of a vector space under the subspace distance $d_s(U,V)=\dim U + \dim V-2\dim(U\cap V)$. In this dissertation we discuss both purely mathematical and practical questions which involve subspace codes. The theoretical part of this work concerns a few special cases of subspace codes. Equidistant subspace codes, in which the distance between any two codewords is identical, are discussed, and bounds and constructions are given. Cyclic subspace codes, which are closed under multiplication by a field element are discussed, and the first non-trivial construction of those is given by using subspace polynomials. The latter topic is related to showing the limits of list-decoding Gabidulin and subspace codes, improving previously known bounds. The practical aspect of this work concerns distributed storage systems. A distributed storage system is comprised of storage nodes with communication links, and the system is required to maintain reliability over time. The aforementioned equidistant subspace codes are shown to be useful for devising a minimum bandwidth regenerating code (MBR) for distributed storage systems, a minimum storage regenerating code (MSR) is constructed using subspace techniques, and finally, the question of local erasure correction in permutations is discussed, under the motivation of performing updates to a distributed storage system.

  • Plug and Play Priors for Poisson Inverse Problems

    דובר:
    אריה רונד, הרצאה סמינריונית למגיסטר
    תאריך:
    יום ראשון, 15.5.2016, 16:30
    מקום:
    טאוב 201
    מנחה:
    Prof. M. Elad

    The Anscombe transform offers an approximate conversion of a Poisson random variable into unit-variance Gaussian one. This transform is important and appealing, as it is easy to compute, and becomes handy in various inverse problems with Poisson noise contamination. Solution to such problems can be done by first applying the Anscombe transform, then applying a Gaussian-noise-oriented restoration algorithm of choice, and finally applying an inverse Anscombe transform. The appeal in this approach is due to the abundance of high-performance restoration algorithms designed for white additive Gaussian noise. This process is known to work well for high SNR images, where the Anscombe transform provides a rather accurate transformation, with nearly constant variance. When the noise level is high, the above path loses much of its effectiveness, and the common practice is to replace it with a direct treatment of the Poisson distribution. Naturally, with this we lose the ability to leverage on vastly available Gaussian-solvers. In this work we suggest a novel method for coupling Gaussian solvers to Poisson noisy inverse problems, which is based on a general approach termed "Plug-and-Play Prior". Deploying the Plug-and-Play Prior approach to such problems leads to an iterative scheme that repeats several key steps: (1) A convex programming task of simple form that can be easily treated; (2) A powerful Gaussian denoising algorithm of choice; and (3) A simple update step. Such a modular method, just like the Anscombe transform based path, enables other developers to plug their own Gaussian solvers to our scheme in an easy way. While the proposed method bears some similarity to the Anscombe operation approach, it is in fact based on a different mathematical basis, which holds true for all SNR ranges. We demonstrate the effectiveness of the proposed scheme on Poisson image denoising and deblurring.

  • Global versus Local Modeling of Signals

    דובר:
    ורדן פפיאן, הרצאה סמינריונית למגיסטר
    תאריך:
    יום שני, 16.5.2016, 10:30
    מקום:
    טאוב 337
    מנחה:
    Prof. M. Elad

    Many image restoration algorithms in recent years are based on patch-processing. The core idea is to decompose the target image into fully overlapping patches, restore each of them separately, and then merge the results somehow. This concept has been demonstrated to be highly effective, leading often times to state-of-the-art results in denoising, deblurring, super-resolution, and other applications. Several questions arise from this line of work: 1) How can the local model be enforced on patches extracted from the final outcome? 2) Can we keep a local treatment while getting a near-optimal global service to the inverse problem at hand? 3) What is the global model corresponding to the local prior? And 4) Can we propose a theoretical backbone for the use of the local model in characterizing the global unknown image? These questions and their answers will be the topic of our talk.

  • Some limitations and possibilities toward data-driven optimization

    דובר:
    Yaron Singer - COLLOQUIUM LECTURE - Note unusual day
    תאריך:
    יום רביעי, 18.5.2016, 14:30
    מקום:
    חדר 337-8 טאוב.
    קישור:
    http://www.cs.technion.ac.il/~colloq/20160518_14_30_Singer.html
  • הכנס השנתי הבינלאומי הששי להנדסת מחשבים בטכניון בנושא תלת-ממד, גרפיקה ממוחשבת, גיאומטריה וכל מה שביניהם

    The 6th Annual International TCE Conference on 3D Visual Computing: Graphics, Geometry and Everything in Between.

    תאריך:
    יום שלישי, 24.5.2016, 09:00
    מקום:
    אולם צ'רציל, הטכניון, חיפה

    הכנס השנתי הבינלאומי הששי להנדסת מחשבים בטכניון בנושא תלת-ממד, גרפיקה ממוחשבת, גיאומטריה וכל מה שביניהם, יתקיים בימים שלישי ורביעי, 24-25 במאי, 2016 בטכניון.

    בין דוברי הכנס ישתתפו:

    Marc Alexa, TU Berlin, Germany
    Alex M. Bronstein, Technion, Israel
    William T. Freeman, MIT, USA
    Thomas Funkhouser, Princeton University, USA
    Kristen Grauman, University of Texas at Austin, USA
    Eitan Grinspun, Columbia University, USA
    Michael Kazhdan, Johns Hopkins University, USA
    Ira Kemelmacher-Shlizerman, University of Washington, USA
    Yaron Lipman, Weizmann Institute of Science, Israel
    Niloy Mitra, University College London, UK
    Srinivasa Narasimhan, Carnegie Mellon University, UK
    Marc Pollefeys, ETH Zurich, Switzerland
    Helmut Pottmann, TU Wien, Austria
    Tali Treibitz, University of Haifa, Israel
    Yair Weiss, The Hebrew University of Jerusalem, Israel

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

  • יום מחקר 2016 בפקולטה למדעי המחשב

    CS RESEARCH DAY 2016

    תאריך:
    יום שלישי, 31.5.2016, 15:30
    מקום:
    בניין טאוב למדעי המחשב

    יום המחקר השישי לתארים מתקדמים בפקולטה למדעי המחשב יתקיים ביום שלישי, 31 במאי 2016, בין השעות 15:30-17:30, בלובי של בניין טאוב למדעי המחשב.

    אירועי יום מחקר הם הזדמנות עבור משתלמי הפקולטה להציג את מחקריהם באמצעות פוסטרים ומצגות בפני אנשי סגל ומנהלים בכירים בטכניון ותלמידים לכל התארים בפקולטה, כמו גם בפני נציגים רמי-דרג מחברות מובילות בתעשייה העילית בארץ ובעולם.

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

    ההשתתפות באירוע אינה כרוכה בתשלום אך דורשת הרשמה מוקדמת.

    פרטים נוספים והרשמה.

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

  • Intel@Technion Lectures: Game Changing Design

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

    produce design developed in through the years in many fronts and requirements. Today SOC products require aggressive targets in all fronts: frequency, performance, low cost, low power…… To address those new and growing requirement there needs to be a basic change in the design concept and solutions. Working in parallel convergence, parallel fronts and analyze tradeoffs together is the approach used to being the best SOC products to the market. This talk is describing the challenge and principals in applying the new approach.

    Short bio:
    Shlomit Weiss, VP Data Center Group – General Manager Silicon Development Networking Group, Intel. In her previous role Shlomit was GM of Client Products Development responsible design of all Client SOC products. In her role managed a cross site organization of about 650 people. Between the products designed and developed in the organization 6th generation “Core names Best processor Ever”. She is based in Intel Israel, has been at Intel since 1989, with a third of her time in different positions in the US. In her career at Intel Weiss has worked in various projects starting in validation, design, cluster manager, and architecture. Previously Weiss managed the architecture of the Intel® Core™ 2 Duo processor definition receiving an Intel Achievement Award, one of most prestigious Intel awards, for the architecture of that CPU. Weiss earned her master's degree cum laude in computer engineering from Technion in Haifa, Israel. In her limited free time, Shlomit enjoys traveling, folk dancing and spending time with her family.