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

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


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

Academic Calendar at Technion site.

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

  • ceClub: IoT-Enabled Community Care Provisioning for Sustainable Ageing-in-Place: A Singapore Example

    דובר:
    טאן הואי פינג (אונ' סינגפור לניהול)
    תאריך:
    יום רביעי, 4.5.2016, 11:30
    מקום:
    חדר 861, בניין מאייר, הפקולטה להנדסת חשמל

    In 2014, 12.4% of the population in Singapore were above 65 years of age and this is projected to increase to 19% by 2030. Among them, those living alone is likely to increase to 83,000 by 2030, up from 35,000 today. The ability to “age in place” - living where you have lived for years with reasonable quality of life, is especially important for the latter group. While Internet of Things (IoT)-enabled ambient intelligence environments that allow caregivers to remotely monitor a loved one’s activities 24/7 are emerging, most of the above systems are technology-centric, operate in silos and do not tie in with end-to-end care provisioning. Moreover, the elderly community exhibit huge variations in their living patterns and behaviour and a one-size-fits-all system will probably not work for all. In this presentation, I will talk about SHINESeniors, an SMU-initiated effort to tackle the above issues through the integration of ambient intelligence with care provisioning, and the personalization of such systems. This research project, supported by the Ministry of National Development and National Research Foundation under the Land and Liveability National Innovation Challenge (L2NIC) funding, is a collaborative effort with A*STAR, Eastern Health Alliance, a voluntary welfare organization, GoodLife!, Tata Consultancy Services, Ministry of Health, Housing and Development Board, and Urban Redevelopment Authority in Singapore.

    Bio:
    Dr. Hwee-Pink TAN currently leads a team of 10 technology and social science researchers to bring together Internet of Things technologies, and social-behavioural research to enable and sustain ageing-in-place, leading, in a broader sense, to intelligent and inclusive societies. Prior to joining SMU in March 2015, he spent 7 years at the Institute for Infocomm Research (I2R), A*STAR, where he was a Senior Scientist and concurrently the SERC Programme Manager for the A*STAR Sense and Sense-abilities Program. In this programme, he led a team of 30 full-time research scientists and engineers to design, pilot and evaluate architectures to support large scale and heterogeneous sensor systems to enable Smart City applications. In recognition of his contributions, he was awarded the I2R Role Model Award in 2012 and 2013, and the A*STAR Most Inspiring Mentor award, TALENT and Borderless Award in 2014. He graduated from the Technion, Israel Institute of Technology, Israel in August 2004 with a Ph.D. In December 2004, he was awarded the A*STAR International Postdoctoral Fellowship. From December 2004 to June 2006, he was a post-doctoral research at EURANDOM, Eindhoven University of Technology, The Netherlands. He was a research fellow with The Telecommunications Research Centre (CTVR), Trinity College Dublin, Ireland between July 2006 and March 2008. He is a Senior Member of the IEEE, has published more than 100 papers, has served on executive roles for various conferences on wireless sensor networks, and is an Area Editor of the Elsevier Journal of Computer Networks. He was Deputy Chair for the ITSC IoT Committee between July 2014 and March 2015. Lastly, he also recently co-founded and chairs the technology and innovation committee of the Stroke Support Station, a registered charity with a focused mission to help Stroke Survivors re-learn and enjoy active living for a better quality of life.

  • Theory Seminar: The Possibilities and Limitations of Private Prediction Markets

    דובר:
    רחל קאמינגס (California Institute of Technology)
    תאריך:
    יום רביעי, 4.5.2016, 12:30
    מקום:
    טאוב 201

    We consider the design of private prediction markets, financial markets designed to elicit predictions about uncertain events without revealing too much information about market participants' actions or beliefs. Our goal is to design market mechanisms in which participants' trades or wagers influence the market's behavior in a way that leads to accurate predictions, yet no single participant has too much influence over what others are able to observe. We study the possibilities and limitations of such mechanisms using tools from differential privacy. We begin by designing a private one-shot wagering mechanism in which bettors specify a belief about the likelihood of a future event and a corresponding monetary wager. Wagers are redistributed among bettors in a way that more highly rewards those with accurate predictions. We provide a class of wagering mechanisms that are guaranteed to satisfy truthfulness, budget balance in expectation, and other desirable properties while additionally guaranteeing epsilon-joint differential privacy in the bettors' reported beliefs, and analyze the trade-off between the achievable level of privacy and the sensitivity of a bettor's payment to her own report. We then ask whether it is possible to obtain privacy in dynamic prediction markets, focusing our attention on the popular cost-function framework in which securities with payments linked to future events are bought and sold by an automated market maker. We show that under general conditions, it is impossible for such a market maker to simultaneously achieve bounded worst-case loss and epsilon-differential privacy without allowing the privacy guarantee to degrade extremely quickly as the number of trades grows, making such markets impractical in settings in which privacy is valued. We conclude by suggesting several avenues for potentially circumventing this lower bound.

    Joint work with David Pennock and Jennifer Wortman Vaughan.

  • Algebraic RAM

    דובר:
    יבגניה פרגמנט, הרצאה סמינריונית למגיסטר
    תאריך:
    יום רביעי, 4.5.2016, 13:30
    מקום:
    טאוב 601
    מנחה:
    Prof. Eli Ben-Sasson

    Due to the lack of computational power, many users don't perform the computation locally, rather outsource the computation to a remote server. This raises the problem of computational integrity. Using Probabilistically Checkable Proofs (PCP) the remote server can prove to the user (with high probability) that the computation was executed correctly. Although every language in NEXP is known to have a PCP system, previous works have not specified the process of converting instances of the bounded halting problem for random access machines (RAM) to instances of a "PCP friendly" NEXP complete language. This problem is highly relevant to the task of creating PCPs for practical problems. We define and describe a general method for representing bounded time RAM programs as instances of a NEXP complete "algebraic constraint satisfaction problem", that are PCP friendly.

  • Interpreting the Ratio Criterion for Matching SIFT Descriptors

    דובר:
    אברהם קפלן, הרצאה סמינריונית למגיסטר
    תאריך:
    יום רביעי, 4.5.2016, 16:30
    מקום:
    טאוב 601
    מנחה:
    Prof. M. Lindenbaum and Dr. T. Avaraham

    Matching keypoints by minimizing the Euclidean distance between their SIFT descriptors is an effective and extremely popular technique. Using the ratio between distances, as suggested by Lowe, is even more effective and leads to excellent matching accuracy. Probabilistic approaches that model the distribution of the distances were found effective as well. This work focuses, for the first time, on analyzing Lowe's ratio criterion using a probabilistic approach. We provide two alternative interpretations of this criterion, which show that it is not only an effective heuristic but can also be formally justified. The first interpretation shows that Lowe's ratio corresponds to a conditional probability that the match is incorrect. The second shows that the ratio corresponds to the Markov bound on this probability. The interpretations make it possible to slightly increase the effectiveness of the ratio criterion, and to obtain matching performance that exceeds all previous (non-learning based) results.

  • Pixel Club: Visual Perception through Hyper Graphs

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

    Computational vision, visual computing and biomedical image analysis have made tremendous progress of the past decade. This is mostly due the development of efficient learning and inference algorithms which allow better and richer modeling of visual perception tasks. Hyper-Graph representations are among the most prominent tools to address such perception through the casting of perception as a graph optimization problem. In this talk, we briefly introduce the interest of such representations, discuss their strength and limitations, provide appropriate strategies for their inference learning and present their application to address a variety of problems of visual computing.

    Bio:
    Nikos Paragios is professor of Applied Mathematics and Computer Science and director of the Center for Visual Computing of CentraleSupelec. Prior to that he was professor/research scientist (2004-2005, 2011-2013)at the Ecole Nationale de Ponts et Chaussees, affiliated with Siemens Corporate Research (Princeton, NJ, 1999-2004) as a project manager, senior research scientist and research scientist. In 2002 he was an adjunct professor at Rutgers University and in 2004 at New York University. N. Paragios was a visiting professor at Yale (2007) and at University of Houston (2009). Professor Paragios is an IEEE Fellow, has co-edited four books, published more than two hundred papers in the most prestigious journals and conferences of medical imaging and computer vision (DBLP server), and holds twenty one US patents. His work has approx 15,750 citations according to Google Scholar and his H-number (03/2016) is 60. He is the Editor in Chief of the Computer Vision and Image Understanding Journal and serves as a member of the editorial board for the Medical Image Analysis Journal (MedIA) and the SIAM Journal in Imaging Sciences (SIIMS). He as served as an associate/area editor/member of the editorial board for the IEEE Transactions on Pattern Analysis and Machine Intelligence (PAMI), the Computer Vision and Image Understanding Journal (CVIU), the International Journal of Computer Vision (IJCV) and the Journal of Mathematical Imaging and Vision (JMIV) while he was one of the program chairs of the 11th European Conference in Computer Vision (ECCV'10, Heraklion, Crete) and serves regularly at the conference boards of the most prestigious events of his fields (ICCV, CVPR, ECCV, MICCAI). Professor Paragios is member of the scientific council of SAFRAN conglomerate.

  • 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
  • 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.