More from Events Calendar
- Feb 55:30 PMRefuge @ MIT: weekly worship, prayer & Bible Study.Refuge @ MIT. Join our weekly gathering for Christian students and seekers as we have worship, prayer and Bible study each Wednesday evening. We share some food and enjoy an in depth Bible study, open to all students at MIT.
- Feb 55:30 PMWrestling PracticeThe MIT wrestling club holds practices in the du Pont Wrestling Room on weeknights 5:30-7pm. All levels of experience welcome! Whether you're looking to learn how to grapple or just want to get in a good workout, wrestling practice is a good time to learn technique, get in some live goes, and have fun with a great group of people.Current schedule is: structured practice MTRF, open mats W, and technique sessions 9-10:30am on Saturday. For more information, contact wrestling-officers@mit.edu.
- Feb 56:00 PMChildbirth Preparation ClassThis six-week course offers soon-to-be parents full evidence-based information about birth and the ability to learn coping techniques such as relaxation, breathing, position practice, and massage. You will have the opportunity to learn about each of these as well as gain hands-on practice.Classes will cover choices in the hospital and how to understand risk reduction for both mother and baby.This class focuses on vaginal birth but also covers what happens in a C-section in case one is needed.Partners are encouraged to attend and will leave with a "toolbox" of support techniques. Handouts are provided.A small introduction to breastfeeding and early post-partum are covered in this course.One registration is good for both the mother and 1 support person.The ideal time to take this course is during the late 2nd trimester to early 3rd trimester.Registration is required on our wellness class website. If you do not already have an account on this website, you'll need to create one. This is a fee-based class and open to the entire MIT community.
- Feb 6–7Schmidt Center – MIT EECS Colloquium: Machine learning to analyze cellular behavior in live-cell imaging experiments of T cell—cancer cell co-culturesBarbara Engelhardt, Gladstone Institutes, Stanford UniversityThursday, February 6, 2025 4:00 – 5:00 pm (refreshments at 3:30 pm) Monadnock (Merkin building/415M 2040)📅 Add to your calendar🖊️ Register hereA week from today — please join us for a colloquium featuring Barbara Engelhardt, Senior Investigator at Gladstone Institutes and Professor in the Department of Biomedical Data Science at Stanford University, on Machine learning to analyze cellular behavior in live-cell imaging experiments of T cell—cancer cell co-cultures.This colloquium is part of a series hosted jointly by the Eric and Wendy Schmidt Center and the Department of Electrical Engineering and Computer Science at MIT.The colloquium will be held at the Broad Institute in Monadnock as well as virtually via YouTube Livestream: broad.io/ewsc. If you do not have a Broad badge, please show up at the 415 Main Street entrance 10 minutes prior to the event to be escorted to the talk.Register here and see the abstract.Questions? Email Amanda Ogden at aogden@broadinstitute.org.
- Feb 64:00 AMRichard P. Stanley Seminar in CombinatoricsSpeaker: Karthik C.S (Rutgers University)Title: Extremal Combinatorial Objects in Hardness of Approximation in PAbstract: In the last decade, the area of hardness of approximation for problems solvable in polynomial time has emerged. One of the popular frameworks for proving such results is called threshold graph composition and relies on the existence and efficient construction of non-trivial extremal combinatorial objects.In this talk, we shall focus on defining and constructing these extremal objects while briefly outlining their applications to hardness of approximation in P.https://math.mit.edu/combin/
- Feb 64:00 AMRichard P. Stanley SeminarsSpeaker: Karthik C.STitle: Extremal Combinatorial Objects in Hardness of Approximation in PAbstract: In the last decade, the area of hardness of approximation for problems solvable in polynomial time has emerged. One of the popular frameworks for proving such results is called threshold graph composition and relies on the existence and efficient construction of non-trivial extremal combinatorial objects.In this talk, we shall focus on defining and constructing these extremal objects while briefly outlining their applications to hardness of approximation in P.https://math.mit.edu/combin/