Colloquia and Seminars

To join the email distribution list of the cs colloquia, please visit the list subscription page.

Upcoming Colloquia & Seminars

  • Geometric algorithms for image and surface analysis

    Speaker:
    Anastasia Dubrovina, Ph.D. Thesis Seminar
    Date:
    Tuesday, 3.2.2015, 11:30
    Place:
    Taub 337
    Advisor:
    Prof. Ron Kimmel

    Various problems involving image and shape representation, analysis and processing share the following common denominator: the complexity and the accuracy of the solution depend on the specific problem formulation and data representation being used. We propose to utilize geometric problem formulations together with novel data representation domains for efficient object segmentation in images and three dimensional shape matching. For automatic image segmentation, we consider the active contours model, combined with the level set framework, and extend its classical solution to obtain an efficient and accurate algorithm for multi-region image and volume segmentation, while exploiting a single level-set function. For user-assisted image segmentation, based on propagating information between pixels via shortest paths between them, we revisit the problem formulation. We show that representing the image as a graph of its level sets, rather than using the standard Cartesian grid, leads to improved segmentation results. For the non-rigid shape matching problem, we show how the matching continuity and the smoothness of the pointwise and pairwise shape properties can be exploited in two different forms to facilitate and improve the matching. It is done by employing a multi-resolution matching algorithm, and by formulating the matching problem in the natural spectral domain.

  • Static Mining of Synchronization Patterns

    Speaker:
    Evgeny Abramovich, M.Sc. Thesis Seminar
    Date:
    Wednesday, 11.2.2015, 12:30
    Place:
    Taub 601
    Advisor:
    Prof. E. Yahav

    We present a static analysis for mining synchronization patterns from a large number of code samples. Our analysis uses automata-based abstraction to capture sequences of API operations and synchronization operations. By combining information about the sequence of API calls with synchronization operations, we uncover the intended synchronization based on the semantics of the underlying component. We address both lock-based synchronization and lock-free patterns. Our approach is implemented in a tool based on the WALA static analysis framework. The tool is applied to identify common synchronization patterns by analyzing popular real-world concurrently used libraries and thousands compiled source files from code search engines.

  • CS M.Sc. & Ph.D. Alumni Event

    CS M.Sc. & Ph.D. Alumni Event

    Date:
    Thursday, 2.4.2015, 14:30
    Place:
    CS Taub

    Dear all,

    We are very excited to invite you to the MSc & PhD alumni event. The event will be held on Thursday, April 2nd at the CS faculty. A detailed invitation will be followed.

    If you are familiar with other MSc & PhD alumni - we'd love to get their contact details to make sure everyone received the invitation.

    Hope to see you,