AFLB

From ResearchWiki

Revision as of 20:37, 21 February 2011 (view source) Amirali (Talk | contribs) (→Feb 24) ← Older edit		Latest revision as of 03:10, 23 February 2011 (view source) Parasaran (Talk | contribs) (→Spring 2011)
Line 28:		Line 28:
	=== Feb 24 ===		=== Feb 24 ===
-	Amirali Will talk about two interesting results,  "Polychromatic coloring for Half-Planes"[http://arxiv.org/abs/1006.3191  Polychromatic coloring]. The fun observation here is the elegant link between hitting sets and coloring problems.	+	Lorenzo Orecchia, UC Berkeley will talk on his recent SODA work: [http://www.eecs.berkeley.edu/~orecchia/academics/orecchiav.pdf Fast Spectral Algorithms for Graph Partitioning and Decomposition].
-		+
-	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 3 ===		=== Mar 3 ===
-	Parasaran	+	Amirali will talk about the [http://eccc.hpi-web.de/report/2011/015/ hardness and non-approximability of Bregman clustering problems].
	=== Mar 10 ===		=== Mar 10 ===

---

Latest revision as of 03:10, 23 February 2011

The Algorithms For Lunch Bunch

Thu @ 11am

Venue: the graphics annex

Contents 1 Spring 2011 1.1 Jan 6 1.2 Jan 13 1.3 Jan 20 1.4 Jan 27 1.5 Feb 3 1.6 Feb 10 1.7 Feb 17 1.8 Feb 24 1.9 Mar 3 1.10 Mar 10 1.11 Mar 17 1.12 Mar 31 1.13 Apr 7 1.14 Apr 14 1.15 Apr 21 1.16 Apr 28 2 Papers for discussion 3 Previous Semesters 4 Contact

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

Lorenzo Orecchia, UC Berkeley will talk on his recent SODA work: Fast Spectral Algorithms for Graph Partitioning and Decomposition.

Mar 3

Amirali will talk about the hardness and non-approximability of Bregman clustering problems.

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

• Papers

Previous Semesters

• Fall 2010
• Spring 2010
• Fall 2009

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.