ViewTube

ViewTube
Sign inSign upSubscriptions
Filters

Upload date

Type

Duration

Sort by

Features

Reset

77 results

Samya Daleh
Viterbi matrix for calculating the best POS tag sequence of a HMM POS tagger

I show you how to calculate the best=most probable sequence to a given sentence. Reference: Kallmeyer, Laura: Finite ...

16:13
Viterbi matrix for calculating the best POS tag sequence of a HMM POS tagger

19,368 views

9 years ago

Maruf Alam Porosh
Viterbi Algorithm in bangla || hidden markov model

1.Global Alignment bangla tutorial Needleman-Wunsch sequence alignment #bioinformatics tutorial ...

8:36
Viterbi Algorithm in bangla || hidden markov model

3,008 views

6 years ago

DSAI by Dr. Osbert Tay
How Deepfake algorithm works | Ian Sullivan

The video was published under the license of the Creative Commons Attribution license (reuse allowed). It is reposted for ...

5:38
How Deepfake algorithm works | Ian Sullivan

10,012 views

5 years ago

Rolando Coto
Spell Checking: Minimum Edit Distance (Accelerated Computational Linguistics 2020.W04.11)

Accelerated Computational Linguistics Dartmouth College LING48/COSC72 Spring 2020. Week 04, Video 11: Spell Checking: ...

8:35
Spell Checking: Minimum Edit Distance (Accelerated Computational Linguistics 2020.W04.11)

1,317 views

5 years ago

Baba's World
GenAI: LLM Decoding Strategies Explained | Greedy, Beam, Top-k, Top-p, Temperature, Contrastive

Ever wondered how Large Language Models (LLMs) like ChatGPT generate text? It's one word at a time. Discover the secret ...

10:46
GenAI: LLM Decoding Strategies Explained | Greedy, Beam, Top-k, Top-p, Temperature, Contrastive

1,068 views

8 months ago

Alice Gao
L14 HMM: Filtering Calculations

Once you're familiar with these calculations you might want to calculate the values more quickly you can do this by using the ...

9:39
L14 HMM: Filtering Calculations

5,285 views

4 years ago

Samya Daleh
Grammar with feature structures as nonterminals

Instead of keeping congruence by writing a rule for each property you can use feature structures as nonterminals instead.

8:44
Grammar with feature structures as nonterminals

1,044 views

8 years ago

Mr Dimmick's Computing Channel
Compressing text using Huffman trees worked example

Leran how to compress a string of text by using Huffman encoding, including constructing a tree from scratch and using it to ...

15:48
Compressing text using Huffman trees worked example

81,445 views

4 years ago

Maruf Alam Porosh
Hidden Markov Model(HMM) || Forward Algorithm in bangla || forward algorithm hidden markov model

1.Global Alignment bangla tutorial Needleman-Wunsch sequence alignment #bioinformatics tutorial ...

16:03
Hidden Markov Model(HMM) || Forward Algorithm in bangla || forward algorithm hidden markov model

5,265 views

6 years ago

Wisc-Online
CRC - Cyclic Redundancy Check

Learn what the CRC is, the technology behind it, and how it's performed.

6:05
CRC - Cyclic Redundancy Check

144,338 views

9 years ago

S. Keshav
Computing stationary probability of a Markov chain

... so solving this becomes uh quite straightforward using any kind of technique such as gaussian elimination and then we can use ...

7:38
Computing stationary probability of a Markov chain

562 views

4 years ago

Alice Gao
L14 HMM: Filtering Derivations

In the previous video i showed you how to calculate the filtering probabilities using the recursive formulas while performing the ...

6:15
L14 HMM: Filtering Derivations

1,591 views

4 years ago

Taylor Gibson
Using the Index of Coincidence to Determine Vigenère Keyword Length

This video will highlight a quantitative method for determining the most likely length of the keyword used to generate a ciphertext ...

5:50
Using the Index of Coincidence to Determine Vigenère Keyword Length

20,324 views

5 years ago

ICLR
ICLR14: O Alsharif: End-to-End Text Recognition with Hybrid HMM Maxout Models

ICLR 2014 Talk: "End-to-End Text Recognition with Hybrid HMM Maxout Models" by Ouais Alsharif, Joelle Pineau.

13:28
ICLR14: O Alsharif: End-to-End Text Recognition with Hybrid HMM Maxout Models

1,047 views

11 years ago

kleines Filmröllchen
But what is digital audio? (The FLAC Codec #1 – (Digital) Audio and PCM)

Episode 1 of the deep-dive series into FLAC, digital audio and its lossless compression. Manim source code for the series: ...

11:26
But what is digital audio? (The FLAC Codec #1 – (Digital) Audio and PCM)

16,449 views

3 years ago

Shuhao Cao
Hidden Markov Chains part 1

Unacceptable so acceptable we use a and unacceptable review and the conditional probability. X + 1. This product is acceptable ...

12:34
Hidden Markov Chains part 1

151 views

5 years ago

ISE FIZ Karlsruhe
Knowledge Graphs - 2.5 RDF Complex Data Structures

Knowledge Graphs - Foundations and Applications Basic Knowledge Graph Infrastructure Speakers: Prof. Dr. Harald Sack Slides: ...

11:52
Knowledge Graphs - 2.5 RDF Complex Data Structures

1,932 views

2 years ago

Matematicko-fyzikální fakulta Univerzity Karlovy
Word alignment - Cutting the chicken-egg problem | MT talks #8

The eighth talk on machine translation covers IBM Model 1, the unsupervised purely lexical word alignment, or a method for ...

7:44
Word alignment - Cutting the chicken-egg problem | MT talks #8

2,947 views

10 years ago

Wireless Explained
What is OFDM?

In this video, we break down the concept of OFDM (Orthogonal Frequency Division Multiplexing)—a key technology behind Wi-Fi, ...

7:40
What is OFDM?

37,523 views

7 months ago

WIT Solapur - Professional Learning Community
Shannon - Fano Coding technique for problems with ambiguity.

This video explains how to apply Shannon-Fano Coding Technique in case of problems having ambiguity in partitioning the ...

8:51
Shannon - Fano Coding technique for problems with ambiguity.

3,706 views

6 years ago