Explore >> Select a destination
|
You are here 
|
www.ethanepperly.com | ||
| | | | |
www.someweekendreading.blog
|
|
| | | | | [Warning: Post contains full frontal nerdity. Bug reports appreciated!] I finally got a copy of Pham-Gia's paper on the distribution of the ratio of 2 independent Beta-distributed random variables. While I still have some childhood trauma around hypergeometric functions like ${}_{2}F_{1}()$ and its even scarier big brother ${}_{3}F_{2}()$... it's time to face my fears. | |
| | | | |
awwalker.com
|
|
| | | | | The integral formula for secant is often introduced in a very artificial way. In this post, I look at the history of this integral and give several derivations. | |
| | | | |
enginius.tistory.com
|
|
| | | | | ?? ??? ? ? ??. GP? mean? kernel? ?? ?? ????. % Reference data f_ref = @(x)( cos(x) ); % reference function t_max = 4*pi; t_ref = linspace(0,t_max,1000)'; x_ref = f_ref(t_ref); % Anchor dataset (training data) n_anchor = 100; t_anchor = linspace(0,t_max,n_anchor)'; noise_var = 1e-2; x_anchor = f_ref(t_anchor) + sqrt(noise_var)*randn(size(t_anchor)); l_anchor = ones(n_anchor,1); % Gaussian random .. | |
| | | | |
www.bazhenov.me
|
|
| | | Introduction Link to heading Varint is a widely recognized technique used for compressing integer streams. Essentially, it suggests that it can be more efficient to encode a number using a variable-length representation instead of a fixed-size binary representation. By removing leading zeros from the binary number, the overall representation size can be reduced. This technique works particularly well for encoding smaller numbers. In this article, I provide a brief introduction and rationale for varint encoding. Additionally, I describe the Stream VByte format, which enables fully vectorized decoding through SSSE3 instructions. I also share my findings from implementing this algorithm in Rust, which includes both encoding and decoding primitives and the ability to read data from both RAM and disk. | ||
