Posters displayed in this page are ordered by alphabetical order of the speakers' surnames. The posters will be displayed during the coffee breaks, where we encourage participants to inquiry about them to the authors attending the conference.
This poster concerns the analysis of computational barriers in a variety of optimisation problems. We have shown that popular methods such as LASSO (used in feature selection), basis pursuit (used in compressed sensing) and linear programming cannot be computed with a computer that can only read approximate input with arbitrarily precise accuracy. There are important links between this work and condition, and this shall be demonstrated and discussed in further detail on the poster.
I will present a website where the user can compute the 3264 conics tangent to their own 5 conics.
We explicitly compute the average condition number for real polynomial eigenvalues of independently distributed Gaussian matrices.
We present the newly developed SQRA finite volume discretization and prove convergence of order 1 for the solution and the fluxes. We further show that SQRA is asymptotically equivalent with the Scharfetter-Gummel scheme.
Develop a mapping from the mechanisms used by the human immune system to confront antigens and build a lifetime of immunity to algorithms and memory strategies that can be used for lifelong learning in engineering applications.