Explore >> Select a destination
|
You are here 
|
highlyscalable.wordpress.com | ||
| | | | |
geo.rocks
|
|
| | | | | Have you ever wondered how HyperLogLog works? Or have you never heard of it at all? In this post I explain the wonderful algorithm of Flajolet et al. from scratch and in a very simple manner. | |
| | | | |
www.jamesridgway.co.uk
|
|
| | | | | Querying large datasets can often be challenging, especially when performance is a key concern. Achieving performance at scale often comes with an element of trade-off in how a system is designed to achieve the desired functionality and performance at scale. A bloom filter is one example of a probabilistic data | |
| | | | |
lsd.gnunet.org
|
|
| | | | | This document contains the R 5 N DHT technical specification. R 5 N is a secure distributed hash table (DHT) routing algorithm and data structure for decentralized applications. It features an open peer-to-peer overlay routing mechanism which supports ad-hoc permissionless participation and support for topologies in restricted-route environments. Optionally, the paths data takes through the overlay can be recorded, allowing decentralized applications to use the DHT to discover routes. This document defines the normative wire format of protocol messages, routing algorithms, cryptographic routines and security considerations for use by implementers. This specification was developed outside the IETF and does not have IETF consensus. It is published here to guid... | |
| | | | |
jmanton.wordpress.com
|
|
| | | If $latex Y$ is a $latex \sigma(X)$-measurable random variable then there exists a Borel-measurable function $latex f \colon \mathbb{R} \rightarrow \mathbb{R}$ such that $latex Y = f(X)$. The standard proof of this fact leaves several questions unanswered. This note explains what goes wrong when attempting a "direct" proof. It also explains how the standard proof... | ||
