All Notes

a sequential data structure where we can add an element to the tail, or remove an element from the head.

a data structure where only the top element is accessible

an algorithm that matches 2-equally sizes groups based on preferences.

a popular divide-and-conquer sorting algorithm

VALL-E can generate speech in anyone's voice with only a 3-second sample of the speaker and some text

A method of computing a token representation that includes the context of surrounding tokens.

we should educate developers accordingly

the smallest polygon that contains a set of points

a widely-known iterate sorting algorithm

the first step to training a neural network successfully