BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//CREST - ECPv5.1.3//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:CREST
X-ORIGINAL-URL:https://crest.science
X-WR-CALDESC:Events for CREST
BEGIN:VTIMEZONE
TZID:Europe/Helsinki
BEGIN:DAYLIGHT
TZOFFSETFROM:+0200
TZOFFSETTO:+0300
TZNAME:EEST
DTSTART:20210328T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0300
TZOFFSETTO:+0200
TZNAME:EET
DTSTART:20211031T010000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Europe/Helsinki:20210428T140000
DTEND;TZID=Europe/Helsinki:20210428T153000
DTSTAMP:20260713T132314
CREATED:20210210T120847Z
LAST-MODIFIED:20210421T060810Z
UID:10638-1619618400-1619623800@crest.science
SUMMARY:Jasmin WERTZ (Duke University) - "Parental investment across a child’s life: Genetic analysis in a multi-cohort study"
DESCRIPTION:\nSocial Science Genetics Paris Seminar : \nTime: 2:00 pm \nDate: 28th of April 2021\nPlace: Visio\nJasmin WERTZ (Duke University) – “Parental investment across a child’s life: Genetic analysis in a multi-cohort study”\n\nOrganizers : \nFelix TROPF (Pôle de Sociologie du CREST)\nSponsors :\nCREST\n
URL:https://crest.science/event/jasmin-wertz/
ATTACH;FMTTYPE=:
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Helsinki:20210428T150000
DTEND;TZID=Europe/Helsinki:20210428T160000
DTSTAMP:20260713T132314
CREATED:20210420T072501Z
LAST-MODIFIED:20210420T072501Z
UID:12626-1619622000-1619625600@crest.science
SUMMARY:Flore SENTENAC (CREST) – “Online Matching in Bipartite Graphs”
DESCRIPTION:\nStatistics-Econometrics-Machine Learning Seminar. \nTime: 15:00 pm – 16:00 pm\nDate: 28th of April 2021\nPlace: Online \nFlore SENTENAC (CREST) – “Online Matching in Bipartite Graphs” \nAbstract : \nFinding large matching in bipartite graphs is a classical problem with many practical and intuitive applications: maximizing the number of students enroled in some university\, the number of paired patients to kidney donors… In this talk\, we are interested in the sequential version of this problem\, where the vertices arrive one after the other and the matching is built on the fly\, which is largely motivated by its Internet advertising display applications. \nThe talk will start with an introduction to the problem and its applications. We will then describe two classical algorithms used to treat the problem\, namely GREEDY and RANKING. We will see how the performance of those algorithms evolves depending on the model considered. To analyze them\, we will introduce classical tools in Online Algorithms Analysis and Random Graphs Theory through their application on a concrete example. \nSponsors: \n\n\n\nCREST \n\n\n
URL:https://crest.science/event/flore-sentenac-crest-online-matching-in-bipartite-graphs/
LOCATION:zoom
END:VEVENT
END:VCALENDAR