University of Cambridge > Talks.cam > Computer Laboratory Research Students' Lectures 2014

Computer Laboratory Research Students' Lectures 2014

Add to your list(s) Send you e-mail reminders

UPDATE MICHAELMAS 2014

The Lectures have returned for a second run! A small selection of the lectures from the research students will be given at 13:00 on Tuesdays starting on 28 October in SW01 . You can bring your sandwiches. SW01 has limited capacity and we recommend getting there promptly to get a seat.

——-

You are all cordially invited to attend a series of 10 lectures written and presented by Computer Lab research students to be given during Easter Term 2014. The lectures will start at 14:00 on Thursday 1 May and run at 14:00 every Monday, Thursday and Friday until Thursday 22 May in Lecture 2 of the William Gates Building.

Topics will vary from “Messing with the Future (or the Art of Continuations)” to “Practical Machine Learning” to “Modern Approaches to Parsing” to “Applied Probabilistic Algorithms for Big Data Analysis” and much, much more.

Should you wish to take part, we will run a test (for fun) at the end of the series, and after the Tripos exams, to be set and marked by the RSL lecturers and for which the best answers will be considered for one of three prizes.

Other views and ways to subscribe

You can include this list in your own website. Read the Instructions on how to include a list in your site and then click on 'Create Custom View' above to get started.

List Managers

Each talk has an organiser. Please contact them in the first instance if you have a query about a particular talk. Only contact one of the people below if you have a question about the list, such as whether your talk or series could be added.

(In order to see the manager's details, such as their e-mail, you will need to have an account and log in)

Lists included in this list

This list does not include any other list

Lists that include this list

Note that ex-directory lists are not shown.

 

© 2006-2020 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity