BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//University of Utah Math Department//Group Synchronization via Cycle-Edge Message Passing//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Group Synchronization via Cycle-Edge Message Passing
X-WR-CALDESC:Group Synchronization via Cycle-Edge Message Passing at University of Utah Mathematics Department
X-WR-TIMEZONE:America/Denver
BEGIN:VEVENT
UID:20210311T160000-gilad-lerman@math.utah.edu
DTSTART;TZID=America/Denver:20210311T160000
DTEND;TZID=America/Denver:20210311T170000
DTSTAMP:20260922T150858Z
SUMMARY:Group Synchronization via Cycle-Edge Message Passing
DESCRIPTION:Speaker: Gilad Lerman\, University of Minnesota\n\nThe problem of group synchronization asks to recover states of objects associated with group elements given possibly corrupted relative state measurements (or group ratios) between pairs of objects. This problem arises in important data-related tasks, such as structure from motion, simultaneous …

LOCATION:JWB 335

URL:https://www.math.utah.edu/research/colloquia/2021-03-11-gilad-lerman/
END:VEVENT
END:VCALENDAR