UTCS Colloquia - Anil Hirani/U. of Illinois at Urbana-Champaign, Dept. of Computer Science, "Optimal (Co)homologous (Co)chains", ACE 4.304

Contact Name: 
Jenna Whitney
Date: 
Mar 2, 2011 1:30pm - 2:30pm

There is a sign-up schedule for this event that can be found at

http://www.cs.utexas.edu/department/webevent/utcs/events/cgi/list_event

s.cgi

Type of Talk: UTCS Colloquia

Speaker/Affiliation: Anil Hira

ni/U. of Illinois at Urbana-Champaign

Talk Audience: UTCS Faculty and

Graduate Students

Date/Time: Wednesday, March 2, 2011, 1:30 p.m.

Location: ACE 4.304

Host: Chandrajit Bajaj

Talk Title: Optimal
(Co)homologous (Co)chains

Talk Abstract:
There is an optimization i

dea that we have found in topology, in finite element methods, and in ran

king problems. I will sketch this common thread in these three diverse fiel

ds. Then I will pick one of these and talk about it in detail. In topology

this shows up in finding optimal chains [STOC 2010, arXiv:1001.0338] and i

n the knot spanning area problem [SoCG 2011, arxiv:1012.3030]. In FEM we s

ee it in the computation of harmonic cochains [arxiv:1012.2835]. And in ran

king it appears in least-squares ranking on graphs [arxiv:1011.1716]. It wo

uld be quite impossible to talk about all these in one talk, were it not f

or the common, specific, optimization concept connecting them all. It is

just a matter of picking integers versus reals, and 1-norm versus 2-norm.