正在加载视频...

视频加载失败

FLASHBACK FRIDAY: Do you remember the time when X and Dundee were fleeing from the cops, and X got caught, but Dundee managed to escape? X (Just X) then deceived the coppas by suggesting that Dundee would surrender himself, not realizing it was all part of their escape plan!

47,091 次观看 • 2 年前 •via X (Twitter)

9 条评论

xQcUpdates 的头像
xQcUpdates2 年前

A twat shortly after they escaped the coppa dogs! #LETEMKNOW

lmfao okay 的头像
lmfao okay2 年前

Dude I remember joining stream everyday and x acting like he wasn’t gonna play rp for 14 hours straight. Some of the BEST streams, so many funny moments

tony 的头像
tony2 年前

Early rp with dundee was unmatched

iqkev 的头像
iqkev2 年前

"do you remember the time when...."

Nick G 的头像
Nick G2 年前

Yes I remember I was there live . Back when there was actually content on NP

Colin Turner 的头像
Colin Turner2 年前

Better than OG Fortnite map

nazis suck 的头像
nazis suck2 年前

lockdown period was something else

hsjidianzjw 的头像
hsjidianzjw2 年前

RP dayz are actually gold, at that time I'm absent of him speed runing and never bother watching it. Months ago during those out of controlp drama days(poke gigi and hdmi triple fcking drama) I sat down and watched them rp vods on youtube and I absolutely love them

Amin 的头像
Amin2 年前

This was so good

相关视频

Do you actually know what convex optimization is in the geometric, guarantee-theoretic sense or have you only met it through solvers and loss curves? Convexity is rare comfort in optimization...there are no spurious local minima, no surprise traps, and inequalities you can use like tools instead of prayers. So, what is this convexity? Let x = (x₁, x₂) and let f(x) be convex. Plot the surface z = f(x). Pick a contact point x₀. The local slope is the gradient p = ∇f(x₀). That p is exactly the data that defines the supporting plane: z = f(x₀) + p · (x − x₀). Thus, f is said to be convex because for every x, f(x) ≥ f(x₀) + p · (x − x₀). So the plane at x₀ can slide under the surface, but it never slices through it. Not near the point...everywhere. Now for here is the interesting part: The slope becomes a coordinate system! Rewrite the same plane as z = p · x − b, where b is the offset. Because the plane passes through (x₀, f(x₀)), the offset is forced to be b = p · x₀ − f(x₀). And that number isn’t just geometry trivia. It’s the convex conjugate: f*(p) = sup over x ( p · x − f(x) ). At a differentiable contact point, the supporting plane touches f tightly enough that the supremum is achieved at x₀, giving the identity f*(p) = p · x₀ − f(x₀) when p = ∇f(x₀). So one moving contact point gives two linked readouts: primal position x₀ dual position (slope) p = ∇f(x₀) dual offset f*(p) One surface. Two worlds. #ConvexOptimization #Optimization #MachineLearning #SignalProcessing #AppliedMath #Engineering

Mathelirium

38,506 次观看 • 9 个月前