AFLB
From ResearchWiki
(→Feb 17) |
m (Feb 17) |
||
| Line 25: | Line 25: | ||
=== Feb 17 === | === Feb 17 === | ||
| - | Parasaran | + | Parasaran will talk about a recent metaclustering paper at SDM 11. "Extending Consensus Clustering to Explore Multiple Clustering Views, Yi Zhang and Tao Li". |
| - | + | ||
| - | + | ||
| - | + | ||
=== Feb 24 === | === Feb 24 === | ||
Revision as of 16:15, 4 February 2011
The Algorithms For Lunch Bunch
Thu @ 11am
Venue: the graphics annex
Contents |
Spring 2011
Jan 6
Amirali will talk about the new lower bound epsilon net results by Pach and Tardos.(Also, some previous work/background over here. Also on the agenda is the plan for the spring algorithms seminar.
Jan 13
Qiushi: ALENEX 11 practice talk.
Jan 20
Jeff will discuss a simplified proof of the epsilon-approximation theorem for range spaces of bounded VC-dimension.
Jan 27
Suresh will do a recap of SODA 11.
Feb 3
Jeff will talk about his recent work on mergeable summaries.
Feb 10
John:
Feb 17
Parasaran will talk about a recent metaclustering paper at SDM 11. "Extending Consensus Clustering to Explore Multiple Clustering Views, Yi Zhang and Tao Li".
Feb 24
Avishek:
Mar 3
Amirali:
Mar 10
Mar 17
Parasaran:
Mar 31
Amirali:
Apr 7
Apr 14
Parasaran: SDM 11 practice talk.
Apr 21
Amirali:
Apr 28
Papers for discussion
Previous Semesters
Contact
If you are interested in giving a talk at AFLB or have questions, please feel free to send a mail to moeller@cs.utah.edu, praman@cs.utah.edu or avishek@cs.utah.edu. If you are planning to give a talk, we would really appreciate if you have an abstract ready a week before the talk is scheduled.
