Replace hash with faster and better finalized hash by orlp · Pull Request #37 · rust-lang/rustc-hash
GitHub - onecodex/rust-bfield: B-field implementation in Rust
The B-field is a novel, probabilistic data structure for storing key-value pairs (or, said differently, it is a probabilistic associative array or map). B-fields support insertion (insert) and lookup (get) operations, and share a number of mathematical and performance properties with the well-known Bloom filter. A B-field lookup will always return the correct value for any inserted key,1 but may r
Queueing – An interactive study of queueing strategies – Encore Blog
We're Encore and we build tools to help developers create distributed systems and event-driven applications. In this blog, you're going on an interactive journey to help you understand common queueing strategies. It's been meticulously crafted with love and attention by Sam Rose. Queues are everywhere. We queue at bars, in restaurants, and at the bank. When you loaded this web page, the request to
CRDT: Text Buffer - Made by Evan
Collaboratively editing strings of text is a common desire in peer-to-peer applications. For example, a note-taking app might represent each document as a single collaboratively-edited string of text. The algorithm presented here is one way to do this. It comes from a family of algorithms called CRDTs, which I will not describe here. It's similar to the approaches taken by popular collaborative te
Computer Scientists Invent an Efficient New Way to Count | Quanta Magazine
Imagine that you’re sent to a pristine rainforest to carry out a wildlife census. Every time you see an animal, you snap a photo. Your digital camera will track the total number of shots, but you’re only interested in the number of unique animals — all the ones that you haven’t counted already. What’s the best way to get that number? “The obvious solution requires remembering every animal you’ve s
rate limiter – smudge.ai blog
Visualizing algorithms for rate limitingMay 15, 2024Why rate limit?Imagine a Twitch chat with many active participants and just one spammer. Without rate limiting, the sole spammer can easily dominate the entire conversation. With rate limiting, each user has a fair chance to participate. A rate limiter lets you control the rate of traffic that your service processes by blocking requests that exce
Flow field pathfinding
You may know me for my interactive tutorials. But before that, I was writing visual but non-interactive tutorials. In particular, there wasn't a lot of information about A* on the web, so I decided to collect all my notes about pathfinding together in one place in the 1990s. But then in the 2010s I started making interactive pages. The newer pages are narrower in scope; I covered a broader set of
A quick post on Chen’s algorithm
Update (April 19): Yilei Chen announced the discovery of a bug in the algorithm, which he does not know how to fix. This was independently discovered by Hongxun Wu and Thomas Vidick. At present, the paper does not provide a polynomial-time algorithm for solving LWE. If you’re a normal person — that is, a person who doesn’t obsessively follow the latest cryptography news — you probably missed last
The Simple Beauty of XOR Floating Point Compression
I recently implemented a small program to visualize the inner workings of a scheme that compresses floating point timeseries by XORing subsequent values. The resulting visualizations are quite neat and made it much easier for me to understand this beautiful algorithm than any of the explanations that I had previously encountered. Hacker News (280 points, 68 comments) The algorithm The algorithm1Th
リリース、障害情報などのサービスのお知らせ
最新の人気エントリーの配信
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く
SoME-3-Living
Simple, Efficient, and Robust Hash Tables for Join Processing
githublog/2024/5/29/fast-inverse-sqrt.md at main · francisrstokes/githublog
Hashing Modulo Theories
chunkedseq
githublog/2024/5/10/cordic.md at main · francisrstokes/githublog
Chapter 0 Preface — CS3 Data Structures & Algorithms
Solving the minimum cut problem for undirected graphs
Knuth–Morris–Pratt illustrated | Journal of Functional Programming | Cambridge Core
A Square-Root Kalman Filter Using Only QR Decompositions
A math puzzle and a better algorithm for top-k | Quickwit