Changing std::sort at Google’s Scale and Beyond
TL;DR; We are changing std::sort in LLVM’s libcxx. That’s a long story of what it took us to get there and all possible consequences, bugs you might encounter with examples from open source. We provide some benchmarks, perspective, why we did this in the first place and what it cost us with exciting ideas from Hyrum’s Law to reinforcement learning. All changes went into open source and thus I can
GitHub - bingmann/cobs: COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)
COBS (COmpact Bit-sliced Signature index) is a cross-over between an inverted index and Bloom filters. Our target application is to index k-mers of DNA samples or q-grams from text documents and process approximate pattern matching queries on the corpus with a user-chosen coverage threshold. Query results may contain a number of false positives which decreases exponentially with the query length a
GitHub - google/differential-privacy: Google's differential privacy libraries.
Note If you are unfamiliar with differential privacy (DP), you might want to go through "A friendly, non-technical introduction to differential privacy". This repository contains libraries to generate ε- and (ε, δ)-differentially private statistics over datasets. It contains the following tools. Privacy on Beam is an end-to-end differential privacy framework built on top of Apache Beam. It is inte
GitHub - dcjones/hat-trie: An efficient trie implementation.
Hat-Trie This a ANSI C99 implementation of the HAT-trie data structure of Askitis and Sinha, an extremely efficient (space and time) modern variant of tries. The version implemented here maps arrays of bytes to words (i.e., unsigned longs), which can be used to store counts, pointers, etc, or not used at all if you simply want to maintain a set of unique strings. For details see, Askitis, N., & Si
OR-Tools | Google for Developers
About OR-Tools OR-Tools is an open source software suite for optimization, tuned for tackling the world's toughest problems in vehicle routing, flows, integer and linear programming, and constraint programming. After modeling your problem in the programming language of your choice, you can use any of a half dozen solvers to solve it: commercial solvers such as Gurobi or CPLEX, or open-source solve
GitHub - efficient/cuckoofilter
Cuckoo filter is a Bloom filter replacement for approximated set-membership queries. While Bloom filters are well-known space-efficient data structures to serve queries like "if item x is in a set?", they do not support deletion. Their variances to enable deletion (like counting Bloom filters) usually require much more space. Cuckoo filters provide the flexibility to add and remove items dynamically
リリース、障害情報などのサービスのお知らせ
最新の人気エントリーの配信
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く
GitHub - woltapp/blurhash: A very compact representation of a placeholder for an image.
GitHub - google/double-conversion: Efficient binary-decimal and decimal-binary conversion routines for IEEE doubles.
GitHub - tlk00/BitMagic: BitMagic Library
GitHub - efficient/SuRF: First Practical and General-purpose Range Filter
overconstrained.io
GitHub - rizkg/BBHash: Bloom-filter based minimal perfect hash function library
GitHub - catid/wirehair: Wirehair : O(N) Fountain Code for Large Data
GitHub - s-yata/marisa-trie: MARISA: Matching Algorithm with Recursively Implemented StorAge
GitHub - Cyan4973/xxHash: Extremely fast non-cryptographic hash algorithm
GitHub - hillbig/wat-array: Automatically exported from code.google.com/p/wat-array
GitHub - ryanrhymes/panns: Python Approximate Nearest Neighbor Search in very high dimensional spaces with optimised indexing.
GitHub - scijs/cwise: Component-wise operations for ndarrays
OpenBR | Home
GitHub - michaelmior/mvptree: A fork of D Grant Starkweather's multiple vantage point tree library
