Category: Blog
-
How to Learn the Viterbi Algorithm: Trellises, Dynamic Programming, Backpointers, Log Probabilities and Sequence Decoding
A Learning Hall guide to the Viterbi algorithm, from hidden Markov models and trellises through dynamic programming, backpointers, log probabilities, complexity and validation.
-
How to Learn Boyer–Moore Majority Vote: Pairwise Cancellation, Candidate Invariants, Verification and Streaming
A Learning Hall guide to Boyer–Moore majority vote, from pairwise cancellation and candidate invariants through verification, streaming constraints and professional testing.
-
How to Learn Dinic’s Algorithm: Level Graphs, Blocking Flows, Current Arcs and Fast Max-Flow
A Learning Hall guide to Dinic’s max-flow algorithm, from residual networks and level graphs through blocking flows, current arcs, correctness, complexity and production testing.
-
How to Learn Sutherland–Hodgman Polygon Clipping: Half-Planes, Edge Cases, Intersections and Convex Windows
A Learning Hall guide to Sutherland–Hodgman polygon clipping, from convex half-planes and the four transition cases through intersection arithmetic, robustness, degeneracies and production geometry boundaries.
-
How to Learn Theta*: Any-Angle Pathfinding, Line-of-Sight Relaxation, Parent Rewiring and Grid Geometry
A Learning Hall guide to Theta* any-angle pathfinding, from A* and line-of-sight parent rewiring through grid geometry, Lazy Theta*, path-quality trade-offs and production verification.
-
How to Learn KLL Quantile Sketches: Compaction Levels, Rank Error, Mergeability and Streaming Percentiles
A Learning Hall guide to KLL quantile sketches, from exact rank and weighted compaction through probabilistic error bounds, merging, distributed percentiles and production verification.
