Basics of algorithmics, computation models, formal languages
published: July 2, 2007, recorded: July 2007, views: 4996
Report a problem or upload filesIf you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Between the many theoretical computer science issues that one should be aware of when working in Machine learning, we visit, in this series of lectures, two.
The first corresponds to strings, and through the study of strings, the questions about more complex structures like trees and graphs. We describe the main algorithmic and combinatorial questions about substrings and subsequences, and concentrate our attention to the topological questions: ordering strings and computing distances and kernels.
The second is complexity. Not only should we be aware (and have a reasonable control of the techniques involved) of the usual barriers, but we should know something about classes for randomized algorithms. We also show some examples concerning Las Vegas and Monte Carlo techniques.
Download slides: bootcamp07_higuera_bacm.pdf (522.0 KB)
Download slides: bootcamp07_higuera_bacm.ppt (723.0 KB)
Link this pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !