AFLB
From ResearchWiki
(→Mar 3) |
(→Mar 3) |
||
| Line 33: | Line 33: | ||
Amirali Will talk about two interesting results, "Polychromatic coloring for Half-Planes"[http://arxiv.org/abs/1006.3191 Polychromatic coloring] | Amirali Will talk about two interesting results, "Polychromatic coloring for Half-Planes"[http://arxiv.org/abs/1006.3191 Polychromatic coloring] | ||
| - | And the "Covering Cubes and the Closest Vector Problem" from SOCG 2011, and it's relation to Integer Programming.[http://arxiv.org/abs/ | + | And the "Covering Cubes and the Closest Vector Problem" from SOCG 2011, and it's relation to Integer Programming.[http://arxiv.org/abs/1012.2289 Closest Vector] |
=== Mar 10 === | === Mar 10 === | ||
Revision as of 19:51, 21 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 merge-able summaries.
Feb 10
Discuss current research problems that people in the lab are working on.
Feb 17
John: "Geodesics in CAT(0) Cubical Complexes, Federico Ardila, Megan Owen, and Seth Sullivant"
Feb 24
Parasaran will talk about a recent metaclustering paper at SDM 11. "Extending Consensus Clustering to Explore Multiple Clustering Views, Yi Zhang and Tao Li".
Mar 3
Amirali Will talk about two interesting results, "Polychromatic coloring for Half-Planes"Polychromatic coloring
And the "Covering Cubes and the Closest Vector Problem" from SOCG 2011, and it's relation to Integer Programming.Closest Vector
Mar 10
Avishek:
Mar 17
Parasaran:
Mar 31
Amirali:
Apr 7
John:
Apr 14
Parasaran: SDM 11 practice talk.
Apr 21
Amirali:
Apr 28
Avishek:
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.
