AFLB

From ResearchWiki

Revision as of 08:46, 28 August 2010 (view source) Parasaran (Talk | contribs) (→Papers for discussion) ← Older edit		Latest revision as of 03:10, 23 February 2011 (view source) Parasaran (Talk | contribs) (→Spring 2011)
(40 intermediate revisions not shown)
Line 1:		Line 1:
	The Algorithms For Lunch Bunch		The Algorithms For Lunch Bunch
-	'''Thu @ Noon (starting Aug 26, 2010)'''	+	'''Thu @ 11am'''
	'''Venue: the graphics annex'''		'''Venue: the graphics annex'''
-	== Fall 2010 ==	+	== Spring 2011 ==
-	=== Aug 26 ===	+	=== Jan 6 ===
		+	Amirali will talk about the new [http://arxiv.org/abs/1012.1240 lower bound epsilon net results by Pach and Tardos].(Also, some previous work/background over [http://infoscience.epfl.ch/record/129411/files/rectangles081707.pdf here]. Also on the agenda is the plan for the spring algorithms seminar.
-	Suresh will talk about the recent [http://michaelnielsen.org/polymath1/index.php?title=Deolalikar%27s_P!%3DNP_paper P vs NP kerfuffle], along with some background on the problem.	+	=== Jan 13 ===
		+	Qiushi: ALENEX 11 practice talk.
-	=== Sep 2 ===	+	=== Jan 20 ===
-		+	Jeff will discuss a simplified proof of the epsilon-approximation theorem for range spaces of bounded VC-dimension.
-	Rasmus will talk about JL on the simplex.	+
		+	=== 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: "[http://arxiv.org/abs/1101.2428 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: [http://www.eecs.berkeley.edu/~orecchia/academics/orecchiav.pdf Fast Spectral Algorithms for Graph Partitioning and Decomposition].
		+
		+	=== Mar 3 ===
		+	Amirali will talk about the [http://eccc.hpi-web.de/report/2011/015/ 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 for discussion ==
Line 19:		Line 59:
	==Previous Semesters ==		==Previous Semesters ==
		+	* [[AFLB/F10|Fall 2010]]
	* [[AFLB/S10|Spring 2010]]		* [[AFLB/S10|Spring 2010]]
	* [[AFLB/F09|Fall 2009]]		* [[AFLB/F09|Fall 2009]]

---

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.