Graduate Computational Algebraic Geometry Seminar
Jan Verschelde
UIC
Polyhedral Saturation to solve the Maximum Likelihood Equations
Abstract: One way to compute the maximum likelihood degree is by solving the maximum likelihood equations.
The polynomial system often has a known irrelevant component that we would rather avoid to recompute.
In this talk I will indicate some polyhedral techniques that can be used to saturate.
Thursday March 4, 2010 at 11:00 AM in SEO 612