AFLB

From ResearchWiki

(Difference between revisions)
Jump to: navigation, search
(Sep 2)
(Sep 2)
Line 15: Line 15:
* Avishek will talk about adaptive methods for multi-task learning ([http://www.cs.utah.edu/~suresh/web/2010/05/26/active-online-multitask-learning/ abstract]) ([http://www.umiacs.umd.edu/~hal/docs/daume10aoml.pdf paper])
* Avishek will talk about adaptive methods for multi-task learning ([http://www.cs.utah.edu/~suresh/web/2010/05/26/active-online-multitask-learning/ abstract]) ([http://www.umiacs.umd.edu/~hal/docs/daume10aoml.pdf paper])
* Suresh will talk about information-theoretic repair for databases violating integrity constraints
* Suresh will talk about information-theoretic repair for databases violating integrity constraints
 +
 +
=== Sep 9 ===
 +
 +
* Rasmus will talk JL on the sphere and the simplex
 +
 +
=== Sep 16 ===
 +
* Parasaran will talk about spatially-aware meta-clustering
== Papers for discussion ==
== Papers for discussion ==

Revision as of 22:53, 1 September 2010

The Algorithms For Lunch Bunch

Thu @ Noon (starting Aug 26, 2010)

Venue: the graphics annex

Contents

Fall 2010

Aug 26

Suresh will talk about the recent P vs NP kerfuffle, along with some background on the problem.

Sep 2

We have a double bill:

  • Avishek will talk about adaptive methods for multi-task learning (abstract) (paper)
  • Suresh will talk about information-theoretic repair for databases violating integrity constraints

Sep 9

  • Rasmus will talk JL on the sphere and the simplex

Sep 16

  • Parasaran will talk about spatially-aware meta-clustering

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.

Personal tools