Technion
 
         Computer Science Colloquium
 
    26/04/2011
 
Time+Place : Tuesday 26/04/2011 14:30 room 337-8 Taub  Bld.
Speaker    : Manor Mendel
Affiliation: Mathematics and Computer Scinece Dept.,
             Open University of Israel
Host       : Nir Ailon
Title      : Ramsey-type theorems for metric spaces
 
Abstract   :
 
Metric spaces are abstraction of distance spaces that come up frequently in
algorithms:
Distances between Euclidean points in Computational Geometry, dissimilarity
in clustering and learning problems, reconfiguration costs in online
algorithms, and many more.
 
We discuss Ramsey-type theorems for metric spaces of the following flavour:
Every metric space contains a (relatively) large subset on which the induced
metric is "highly structured".
 
We will see applications of the theorem for online computation and proximity
data structure.
 
Short Bio:
Prof. Mendel is a faculty member at the Mathematics and Computer Science
Department of the Open University of Israel since 2005.   He obtained his
Ph.D. in Computer Science from Tel-Aviv University in 2001, and subsequently
spent 4 years as a post-doc at the Hebrew University, UIUC, and Caltech.
His research interests are in algorithms and geometry in discrete metric
spaces, metric geometry, optimization algorithms, data structures and online
algorithms.
 
Refreshments served from 14:15 on,
 	Lecture starts at 14:30
 
----------------------------------------------------------
Visit our home page-   <http://www.cs.technion.ac.il/~colloq>
 
---------------------------------------------------------
Technion Math. Net (TECHMATH)
Editor: Michael Cwikel   <techm@math.technion.ac.il> 
Announcement from: Hadas Heier   <heier@cs.technion.ac.il>