![[Search]](/static/images/search.gif){kind=small}
![[A-Z Index]](/static/images/az.gif){kind=small}
![[Contact]](/static/images/contact.gif){kind=small}
![[University of Cambridge]](/static/images/identifier2.gif){kind=small}
![[Talks.cam]](/static/images/talkslogosmall.gif)
Monday 02 June 2008, 11:15-12:15
Uniform sampling from various sets
- 👤 Speaker: Philip Sterne (University of Cambridge)
- 📅 Date & Time: Monday 02 June 2008, 11:15 - 12:15
- 📍 Venue: TCM Seminar Room, Cavendish Laboratory, Department of Physics
Questions? Contact
Carl Scheffler
Abstract
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 complexity of your solutions.
Sample uniformly from the following sets:- Subsets of size k (from a larger set of n items)
- The set of all permutations with n items
- The set of all binary trees with n nodes
- The set of all partitions with n items
I will be cheating and presenting some interesting solutions from Chapters 12 and 13 of the book Non-Uniform Random Variate Generation
Series This talk is part of the Machine Learning Journal Club series.
Included in Lists
- Cambridge talks
- Guy Emerson's list
- Hanchen DaDaDash
- Inference Group Journal Clubs
- Inference Group Summary
- Interested Talks
- Machine Learning Journal Club
- Machine Learning Summary
- ML
- Quantum Matter Journal Club
- rp587
- TCM Seminar Room, Cavendish Laboratory, Department of Physics
- TQS Journal Clubs
- yk373's list
Note: Ex-directory lists are not shown.