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

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


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

Academic Calendar at Technion site.

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

  • Robust and Simple Market Design

    דובר:
    Inbal Talgam Cohen - CS-Lecture
    תאריך:
    יום שני, 23.1.2017, 10:30
    מקום:
    חדר 601 טאוב.
    קישור:
    http://www.cs.technion.ac.il/~colloq/20170123_10_30_Talgam.html
  • Pixel Club: ​Human Pose Estimation using Deep Consensus Voting

    דובר:
    איתן פתיה (מכון ויצמן למדע)
    תאריך:
    יום שלישי, 24.1.2017, 11:30
    מקום:
    חדר 1061, בניין מאייר, הפקולטה להנדסת חשמל

    I will present out approach to human pose estimation, where each location in the image votes for the position of each keypoint using a convolutional neural net. The voting scheme allows us to utilize information from the whole image, rather than rely on a sparse set of keypoint locations. Using dense, multi-target votes, not only produces good keypoint predictions, but also enables us to compute image-dependent joint keypoint probabilities by looking at consensus voting.

    Joint work with Ita Lifshitz.

    Bio: ​I received my PhD from the Weizmann Inst. under the supervision of Shimon Ullman and currently working at GM advanced technical institute in Israel.

  • יריד פרוייקטים בפיתוח תוכנה ב-IoT ו-Android

    Project Fair in IoT and Android

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

    המעבדה לפיתוח מערכות ותוכנה בפקולטה למדעי המחשב מזמינה אתכם לבקר ביריד פרוייקטים בפיתוח תוכנה ב-IoT ו-Android  ולהתרשם מפרוייקטים חדשים אשר יוצגו על-ידי צוותי הפיתוח. האירוע יתקיים ביום שלישי, 24 בינואר 2017, בין השעות 12:30-14:30, בקומת הכניסה, בניין טאוב למדעי המחשב.


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


    להלן הפרוייקטים המציגים:

    ANDROID

    BicyCare
    Protects bike riders on the road. The app identifies irregular stops and falls and can call for help when needed.

    Flashdine
    No need to wait for a waiter ever again. You can order food and drinks and get the check directly from the app.

    SociaLift
    Your own personnal trainer. Track your workouts, see your progress and compete against friends in the gym.

    SWISH
    Never ask "what is that over there?" again. Just point your phone and the app will tell you which landmarks are in your view.

    KeepTrip
    Document your trips with ease. Flag interesting locations and build a trip timeline with pictures and descriptions.

    LeaveIt
    The perfect way to surprise your friends. Leave messages for your friends at certain locations and they will get them when they get there.

    TellMom
    Mom: "Text me when you get there", you: "I'll just have the app do it for me". Automatically send out texts when you reach a specific location.

    Run2
    Running with a partner is way more fun. Let the app find a partner for you and compete even if you're not on the same track.

    Frinsulin
    A meal advisor for diabetics. Help diabetic people estimate insulin needs after a meal so they can stay balanced and healthy.

    LocaDo
    Location based reminders. Instead of getting a reminder at a certain time, set your reminders to pop up at relevant places.

    LikeMyStyle
    Tinder for your cloths. Let other people rate your outfit and help you choose what to wear and what to buy.

    ComuniPark
    Finally you don't have to spend time looking for parking. Find recently vacant parking spots and mark you spot as free when you leave it.


    IOT

    Smart Gym
    Make the workout experience more interactive, record it, keep track of your exercises, explore personalized exercises.

    Smart Mail Box
    Notify when a new Snail-Mail is received (with a photo of the letter).

    iFold Project
    A robot that folds your laundry.

    Hot Wire 3D Cutter
    A sculptor that creates 3D models. The machine sculpts blocks into a desired model.

    Polargraph
    A Whiteboard Drawing Robot that draws graphs (vertexes and arcs/edges) on a whiteboard.

    Beer Pong
    Plays Ping Pong with you in the Pub.

    The Pill Dispenser
    Automates the process of distributing medicine to small groups of patients.

    Guzzler
    Monitors financial expenses and power consumption of your appliances and presents real time data and costs.

    Smart Parking Pole
    Using a mobile app, users can get information of parking availability and schedule reservations for certain cars.

    Connect Four
    Play "Connect Four" - live!, with our robot.

    Clock Wise
    Helps you to sleep well and and to wakeup comfortly.

    Seeing is Believing
    Museum exhibits come to life with IoT enabled.

    TamReader
    Monitors the driver's behavior by analyzing the street signs.

  • Theory Seminar: Lower Bound on the Step Complexity of Anonymous Binary Consensus

    דובר:
    אוהד בן-ברוך (אונ' בן-גוריון
    תאריך:
    יום רביעי, 25.1.2017, 12:30
    מקום:
    טאוב 201

    Obstruction-free consensus, ensuring that a process running solo will eventually terminate, is at the core of practical ways to solve consensus, e.g., by using randomization or failure detectors. An obstruction-free consensus algorithm may not terminate in many executions, but it must terminate whenever a process runs solo. Such an algorithm can be evaluated by its solo step complexity, which bounds the worst case number of steps taken by a process running alone, from any configuration, until it decides.

    We will present a lower bound of $\Omega(\log n)$ on the solo step complexity of obstruction-free binary anonymous consensus. The proof constructs a sequence of executions in which more and more distinct variables are about to be written to, and then uses the backtracking covering technique to obtain a single execution in which many variables are accessed.

  • אירוע יאהו במדעי המחשב

    YAHOO DAY at CS

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

    חברת יאהו תקיים אירוע שנתי בפקולטה ביום רביעי, 25 בינואר, 2017, בין השעות 15:00-16:45, בחדר 337, בניין טאוב למדעי המחשב.

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

    תוכנית מלאה ופרטים נוספים במודעה המצורפת.

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

  • CGGC Seminar: Subdivision Based Solvers: Solutions with Topological Guarantee of Algebraic Sets with Applications

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

    Algebraic constraints arise in various applications, across domains in science and engineering. Polynomial and piece-wise polynomial (B-Spline) constraints are an important class, frequently arising in geometric modeling, computer graphics and computer aided design, due to the useful NURBs representation of the involved geometries. Subdivision based solvers use properties of the NURBs representation, enabling, under proper assumptions, to solve non-linear, multi-variate algebraic constraints - globally in a given domain, while focusing on the real roots. In this talk, we present three research results addressing problems in the field of subdivision based solvers.

    The first presents a topologically guaranteed solver for algebraic problems with two degrees of freedom. The main contribution of this work is a topologically guaranteed subdivision termination criterion, enabling to terminate the subdivision process when the (yet unknown) solution in the tested sub-domain is homeomorphic to a two dimensional disk. Sufficient conditions for the disk-topology are tested via inspection of the univariate solution curve(s) on the sub-domain’s boundary, together with a condition for the injective projection on a two dimensional plane, based on the underlying implicit function and its gradients.

    The second result provides a subdivision based method for detecting critical points of a given algebraic system. To find critical points, we formulate an additional algebraic system, with the semantics of searching for locations where the gradients of the input problem are linearly dependent. We formulate the new problem using function valued determinants, representing the maximal minors of the input problem’s Jacobian matrix, searching for locations where they simultaneously vanish. Consequently, an over-constrained system is obtained, involving only the original parameters. The over-constrained system is then solved as a minimization problem, such that all constrains are accounted for in a balanced manner.

    The third result applies the subdivision method to the specific problem of Minkowski sum computation of free-form surfaces. As a first step, a two-DOF algebraic system is formulated, searching for parameter locations that correspond to parallel (or anti-parallel) normal vectors on the input surfaces. Only such locations can contribute to the Minkowski sum envelope surface – which is the required representation for the (typically) volumetric object given by the Minkowski sum. A purging algorithm is then executed, to further refine redundant solution locations: surface patches that admit matched normal directions, but cannot contribute to the envelope.

    The talk summarizes the research towards PhD in applied mathematics, under supervision of Prof. Gershon Elber.

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