graduate computational algebraic geometry seminar
Sonja Petrovic
UIC
Maximum Likelihood and Identifiability Equations - an example
Abstract: We will see how to set up the MLE problem in a symbolic
computation package, and solve it for a particular system of interest.
Then we will go over the computational challenge of
Allman-Petrovic-Rhodes-Sullivant concerning identifiability equations
for mixture models.
Thursday January 28, 2010 at 11:00 AM in SEO 612