BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Uniform sampling from various sets - Philip Sterne (University of 
 Cambridge)
DTSTART:20080602T101500Z
DTEND:20080602T111500Z
UID:TALK12010@talks.cam.ac.uk
CONTACT:Carl Scheffler
DESCRIPTION:This week's journal club has a computer science flavour.  Try 
 to solve the following tasks giving a loose bound on the space and time co
 mplexity of your solutions.\n\nSample uniformly from the following sets:\n
 # Subsets of size k (from a larger set of n items)\n# The set of all permu
 tations with n items\n# The set of all binary trees with n nodes\n# The se
 t of all partitions with n items\n\nI will be cheating and presenting some
  interesting solutions from Chapters 12 and 13 of the book "Non-Uniform Ra
 ndom Variate Generation":http://cg.scs.carleton.ca/~luc/rnbookindex.html\n
 \n
LOCATION:TCM Seminar Room\, Cavendish Laboratory\, Department of Physics
END:VEVENT
END:VCALENDAR