top 10 explanations of al time

Hoooiiiyyy

Best best best explanation.. thank you very much

Very good ❤

Thanks for the video. I'm finding some interesting results though. It seems that when the charts and cluster graphs for a pair of instruments seem to show high correlation, like HD/ LOW, the adfuller test shows weak correlation, but when the charts and graphs seem to show weak or opposite price action, the adfuller values show strong correlation, like FDX/ UPS.

Best one so far! Thank you!

YES. I came to connect the dots between these two approaches on my own, and I was wondering if others had, or if it had been formalized. But searching "DAG shortest path" and "DP" often lead instead to a DP algorithm for solving DAG shortest path instances. Funny that it comes full-circle and all, but not what I was looking for. Finally found it here!

hey I had a doubt for iteration 1 why didnt you consider the most recent value of Page rank of A 1/12 for calculating page rank of B?

thank you !

Good explanation thanks but the graph in the example is a cyclic graph. How can you perform topological sorting in directed cyclic graph? I think the concept of topological sorting is not related with Kosaraju's Algorithm.

Fantastic! Although I'm wondering how would the iteration, the weight and alpha formula change if the samples in input were more than one.

How is vertex 3-4-8 strongly connected components?

Magnificent video. So clear explanation of the algorithm and how it works!

&hoyt

&eye blows out by green

best explanation, thank you

Wait, we playing tennis or golf??

Just reviews rotations (not unique to splay tress) and says the same 4 things over and over and over again.

Stellar explanation, thanks for the video!

It was quite good ❤

Caching is actually NOT the most important thing here.. This is a dynamic data structure which changes over time.. The "Balancing" pronounced "BAAAAAAALANCE", is a VERY IMPORTANT feature here for amortized analysis over this data structure. It's not a biproduct, but the MAIN idea behind splaying trees. If you read the article about it, you see caching can be achieved with "single rotations" instead of splaying, But will cause a TERRIBLE binary search tree.. as in worst case examples, accessing items will take O(n).

The math is conceptually accurate, but your equation for residuals fails to consider the y intercept. The residuals should be the difference between y_actual & y_model: R = y_actual - m_model*x_actual - y-int_model. Building a trading method around the system you describe with this fundamental error might result in significant loss of any statistical advantage (depending on how the viewer proceeds). When checking for stationarity, the test involves first differences, so the y-int dissapears. that is a fortunate coincidence for you I supposed, but nevertheless your formulation and explanation are not accurate and this could lead others to losing money if they want to use the ideas here to build their own methodology.

7 minutes to understand a concept that took my professor 2 lectures to explain (I still didn't get it by the end of the second lecture)

Can u please share this presentation .

Thanks very good explanation

Quality explanation, thanks!

brilliant

Being French, I think your English is really easy to understand, it's a real asset and it's nice to listen to thank you

The best splay tree video available! Thank you!

"any object created in the heap space has global access and can be referenced from anywhere of the application". Is this statement true?

Everyone praising this video but the calculations are so messed up in this video

Thanks🎉🎉

Best explanation! thanks

can i get this java code for filtering web links using bfs

that was the most useful explanation that I've ever seen for page rank thank u

wheres mario

Great explanation

Such a great lecture!

I saw this ABSOLUTE FOOL trying to explain AVL trees in a video and it was PATHETIC! Not only he CANT EVEN SPEAK RIGHT, he makes TERRIBLE OMITIONS, dont explain properly, makes TONS OF MISTAKES, is mentally challenged! DONT BUY HIS CRAP, trust me!

You need to work on your English, seriously, you might even be decent in your native language but in English you CANNOT TEACH COMPLEX MATTERS. It is confusing, you dont explain clearly.

good explanation???? have you guys actually seen this FOOL that CANT EVEN SPEAK right trying to teach binary search tree?? HE IS LITERALY mentally challenged, trying to TEACH people?? THIS IS A F---ING JOKE!

You are literally the WORST teacher I EVER seen! You cant speak right, you make several mistakes that induce the student to errors, and If I didnt know better, I would think you probably DONT understand half the things you say! WHY IN THE F#)$( ARE PEOPLE THAT CANT EVEN EXPRESS THEMSELVES CLEARLY TRYING TO TEACH ANYONE ELSE!??!?!??!?!

Bro, I was following your linked list videos and damn man, first you say ling list, then the way you explained the algo is so confusing, you come up with vars and dont explain them properly, I dont know, for me it was super confusing, sure you can code, but can you teach? me thinks not.

Your calculations are wrong in my calculator answers are different but at the end c have more my c have 0.375 , a have 0.124 , b have 0.166 , d have 0.333

thank you bro

I want this code if yu can provide

Very hard to find quality content on Splay Trees, thank you very much !

very clear thank you very much!

The best explanation ever👍

Thank you 🙂