Department of Computer Science | Institute of Theoretical Computer Science | CADMO
Prof. Emo Welzl and Prof. Bernd Gärtner
Mittagsseminar Talk Information |
Date and Time: Thursday, May 04, 2006, 12:15 pm
Duration: This information is not available in the database
Location: This information is not available in the database
Speaker: Jiří Matoušek (Charles Univ., Prague)
The Johnson-Lindenstrauss lemma is the following important and counter-intuitive fact: Any set of n points in the n-dimensional Euclidean space can be mapped to the Euclidean space of dimension only O(log n) almost isometrically; that is, so that no distance is distorted by more than 1%. A suitable mapping is given by a random projection. We discuss a somewhat streamlined approach to the proof, which subsumes some variants of the lemma recently treated in the literature. Most of the time we will pass from tail estimates to the moment generating function and back; this kind of gymnastics may be useful in other contexts as well.
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