Search for tag: "machines"

EP1 - Week 2 Brief - 2021-22 - Part2 - Slides

EP1 - Week 2 Brief - 2021-22 - Part2 - Slides

From  Simone Dimartino on September 25th, 2021 0 likes 54 plays 0  

Machine Learning for extremes: Liujun Chen

This talk has been automatically captioned. You can remove these by pressing CC on the video toolbar. Name: Liujun Chen Talk Title: Distributed Inference for Extreme Value Index Abstract: We…

From  Belle Taylor on June 29th, 2021 0 likes 42 plays 0  

Machine Learning for extremes: Chen Zhou

This talk has been automatically captioned. You can remove these by pressing CC on the video toolbar. Name: Chen Zhou Talk Title: Distributed Inference for Tail Empirical and Quantile…

From  Belle Taylor on June 29th, 2021 0 likes 49 plays 0  

Liujun Chen EVA Talk Preview

This talk has captions. You can remove these by pressing CC on the video toolbar. Name: Liujun Chen Talk Title: Distributed Inference for Extreme Value Index Abstract: We investigate a…

From  Anna Munro on May 24th, 2021 0 likes 14 plays 0  

Chen Zhou EVA Talk Preview

This talk has captions. You can remove these by pressing CC on the video toolbar. Name: Chen Zhou Talk Title: Distributed Inference for Tail Empirical and Quantile Processes Abstract: The…

From  Anna Munro on May 18th, 2021 0 likes 35 plays 0  

CDCS Annual Lecture: Aimée Morrison

The Centre for Data, Culture & Society presents the inaugural CDCS Annual Lecture 2020: 'Hello World: or, how we learned to stop worrying, and love the computer' In this lecture, Prof…

From  Roisin O'Brien on December 16th, 2020 0 likes 52 plays 0  

CL - 16 - ε-transitions and the subset construction

This is a raw video from 2019. I've not yet had time to edit it into chunks. If you have any questions, or find any errors, please let me know on Piazza.

From  Haoran Peng on November 23rd, 2020 0 likes 227 plays 0  

CL - 15e - RS -- Concatenation

We use ε-transitions to connect two NFA and create a machine that recognises the concatenation of their languges.

From  Haoran Peng on November 23rd, 2020 0 likes 257 plays 0  

CL - 15c - Introducing ε-transitions

We introduce NFA - automata with ε-transitions

From  Haoran Peng on November 23rd, 2020 0 likes 271 plays 0  

CL - 15b - Boolean operations on DFA-Regular Languages

Since DFA-regular languages are closed under complements and intersections, they are closed under all Boolean operations.

From  Haoran Peng on November 22nd, 2020 0 likes 311 plays 0  

CL - 15a - Regular Languages (III) : DFA-regular

Our third definition: we say a language is DFA-regular if it is the language recognised by some DFA.We show that the complement of a DFA-regular language is DFA-regular.

From  Haoran Peng on November 22nd, 2020 0 likes 348 plays 0  

CL - 14d - Regular Languages (II)

We give a second definition of regular language as the languages generated from the empty and singleton languages by the operations of, concatenation, alternation, and iteration.

From  Haoran Peng on November 20th, 2020 0 likes 161 plays 0  

CL - 13a - Machines

This video introduces the notion of a machine.

From  Claudia-Elena Chirita on November 20th, 2020 0 likes 190 plays 0  

Home Studio Kit: 'How to' use the Hue Document Cam on a Windows PC

This short video shows PC users how to set up and use the Hue Document Cam that comes in your Home Studio Kit. For more information on the Home Studio Kits, please view the other video tutorials in…

From  Mari-Nikol Panteva on November 19th, 2020 0 likes 18 plays 0  

CL - 13d - Black holes and DFA

We begin with a short discussion of the history and some applications of FSM. We then introduce Deterministic Finit-state Automata (DFA), and the use of the black hole convention when presenting…

From  Haoran Peng on November 18th, 2020 0 likes 299 plays 0  

CL - 14c - Regular Languages (I)

We give a first definition of regular language as a language that is accepted by some FSM.

From  Haoran Peng on November 18th, 2020 0 likes 258 plays 0