BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//lodo.com//What's on in LoDo//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:LoDo — What's on
X-WR-TIMEZONE:America/Denver
REFRESH-INTERVAL;VALUE=DURATION:PT1H
BEGIN:VEVENT
UID:cu-denver:48862@lodo.com
DTSTAMP:20261122T212020Z
DTSTART:20261207T190000Z
DTEND:20261207T203000Z
SUMMARY:Alexander Semyonov’s MS in Applied Mathematics Project Presentatio
 n
LOCATION:Student Commons 4017
DESCRIPTION:Title: Algorithms for the Computation of Upper Envelopes Abstr
 act: Given a family of real-valued functions\, the upper envelope is the 
 function whose value at a given point is the maximum attained by the func
 tions in the family defined at that point. For a family of continuous\, u
 nivariate functions\, in which every pair of distinct functions intersect
 s a finite number of times\, the sequence of functions appearing on the u
 pper envelope corresponds to a Davenport-Schinzel sequence. This report w
 ill investigate the relationship between upper envelopes and Davenport-Sc
 hinzel sequences and examine established bounds on the length of an upper
  envelope sequence. Two efficient algorithms are presented for the comput
 ation of the upper envelope of continuous\, univariate\, totally-defined 
 functions. The first algorithm follows a simple divide-and-conquer scheme
  in which the family of functions is divided into two halves\, the upper 
 envelope of each half is computed recursively\, and the resulting envelop
 es are merged to build the complete upper envelope. The second algorithm 
 utilizes a stack-based approach\, analogous to convex hull construction\,
  to compute the upper envelope of a family of linear…\nTickets/details: h
 ttps://calendar.ucdenver.edu/event/alexander-semyonovs-ms-in-applied-math
 ematics-project-presentation\nMore: https://lodo.com/events/3278712
URL:https://lodo.com/events/3278712
END:VEVENT
END:VCALENDAR
