Events Search and Views Navigation

Event Views Navigation

Today

  • Lecture_Sahai-pdf

    CMSA Math-Science Literature Lecture: Indistinguishability Obfuscation: How to Hide Secrets within Software

    Virtual

    Amit Sahai  (UCLA) Title: Indistinguishability Obfuscation: How to Hide Secrets within Software Abstract: At least since the initial public proposal of public-key cryptography based on computational hardness conjectures (Diffie and Hellman, 1976), cryptographers have contemplated the possibility of a “one-way compiler” that translates computer programs into “incomprehensible” but equivalent forms. And yet, the search for such a “one-way […]

  • CMSA Math-Science Literature Lecture: Moment maps and the Yang-Mills functional

    Virtual

    Frances Kirwan (University of Oxford) Title: Moment maps and the Yang-Mills functional Abstract: In the early 1980s Michael Atiyah and Raoul Bott wrote two influential papers, ‘The Yang-Mills equations over Riemann surfaces’ and ‘The moment map and equivariant cohomology’, bringing together ideas ranging from algebraic and symplectic geometry through algebraic topology to mathematical physics and number theory. […]

  • Compbiotextlessfeature-600x338

    Computational Biology Symposium

    20 Garden Street Cambridge, MA 02138, MA, MA, United States

    On May 3, 2021 the CMSA will be hosting a Computational Biology Symposium virtually on Zoom. This symposium will be organized by Vijay Kuchroo. The symposium will begin at 10:00am ET. There will be a morning and afternoon session, with an hour break for lunch. Videos of the talks can be found in this Youtube playlist. Links are also available in the […]

  • Rank-Based Independence Testing in Near Linear Time

    Speaker: Chaim Even-Zohar (Alan Turing Institute, London) Title: Rank-Based Independence Testing in Near Linear Time Abstract: In 1948 Hoeffding proposed a nonparametric test that detects dependence between two continuous random variables (X,Y), based on the ranking of n paired samples (Xi,Yi). The computation of this commonly-used test statistic requires O(n log n) time. Hoeffding's test is consistent […]

  • Summer,Warm,Sun,Light,Forest,Aerial,View

    FRG Workshop on Geometric Methods for Analyzing Discrete Shapes

    Virtual

    This workshop will take place May 7-9 (Friday-Sunday), 2021 virtually on Zoom The aim of the workshop is to bring together a community of researchers in mathematics, computer science, and data science who develop theoretical and computational models to characterize shapes and analysis of image data. This workshop is part of the NSF FRG project: […]