Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Thursday, October 14, 2010, 12:15 pm

Duration: This information is not available in the database

Location: OAT S15/S16/S17

Speaker: Martin Jaggi

A typical day in the life of the optimization problem max xT A x

We will consider two variants of the optimization problem max xT A x, for a matrix A. This problem is at the core of principal component analysis (PCA), most classification methods, and many other approaches in and outside machine learning. In one variant, the domain for x will be the ||.||2-sphere, whereas in the second case it is part of the ||.||1-sphere.

In the remainder of the talk, we will elaborate on the quality of comments on YouTube, portfolio optimization, MAX-CUT, population genetics, Google, movie rental, baseball bats and sociology, the iTunes Genius feature, email spam, and not to forget: automated face detection.

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2024  2023  2022  2021  2020  2019  2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M   |   admin login