
Recent Posts
Recent Comments
metric2011 on Notes of Sa’ar Hersonsky… CH on Videos Stefan Wenger on Notes of Stefan Wenger’s… Stefan Wenger on Notes of Stefan Wenger’s… Stefan Wenger on Notes of Stefan Wenger’s… Archives
 June 2017
 May 2017
 April 2017
 March 2017
 February 2017
 January 2017
 March 2016
 February 2016
 October 2015
 August 2015
 February 2015
 November 2014
 October 2014
 September 2014
 June 2014
 May 2014
 April 2014
 March 2014
 February 2014
 January 2014
 December 2013
 November 2013
 October 2013
 July 2013
 May 2013
 February 2013
 December 2012
 November 2012
 October 2012
 September 2012
 July 2012
 June 2012
 May 2012
 April 2012
 March 2012
 February 2012
 January 2012
 September 2011
 August 2011
 April 2011
 March 2011
 February 2011
 January 2011
Categories
Meta
Monthly Archives: January 2011
Notes of Jean Lasserre’s lecture nr 1
Moments, positive polynomials and optimization Hierarchies will come only at the very end, as a tool that helps solving basic problems with many applications. The main theorems will have two facets: real algebraic geometry (positive polynomials), and functional analysis … Continue reading
Notes of Nati Linial’s lecture nr 2
Last time, I went through fundamental results in extremal graph theory and explained the model. Today, I will go more into results of mine. But let me finish the proof of a theorem I quoted last time. 1. Back to … Continue reading
Abstract of Urs Lang’s course
Injective metric spaces, or absolute 1Lipschitz retracts, share a number of properties with CAT(0) spaces. In the 1960es, Isbell showed that every metric space possesses an essentially unique injective hull (envelope), and Cohen established the corresponding result in the linear … Continue reading
Notes of Guy Kindler’s lecture nr 1
Dictatorship testing and hardness of approximation We shall explain a few sharp hardness of approximation results. This involves several components: PCP, Parallel Repetition, discrete analysis. Then all these components must be merged together, and it is usually delicate. Several points … Continue reading
Slides of Claire Mathieu’s lecture nr 5
Claire wrote on the tablet ihpjan252011 and used part of the following slides clusteringGDR
Notes of Claire Mathieu’s lecture nr 5
Scribe: Eric Colin de VerdiÃ¨re Here is the plan for today: Duality in linear programming, duality in semidefinite programming, application to correlation clustering (work by Warren Schudy and Claire Mathieu, SODA’10). 1. Duality As an example, let us consider the … Continue reading
Notes of Alain Valette’s lecture nr 3
In the first and second lectures, I defined coarse embeddings and gave examples. Now I give more details. 1. Examples of spaces not embeddable into Hilbert spaces Definition 1 Let be a family of finite collected, regular graphs, … Continue reading