[CVPR20 Tutorial] Billion-scale Approximate Nearest Neighbor Search[CVPR20 Tutotrial] Image Retrieval in the Wild https://matsui528.github.io/cvpr2020_tutorial_retrieval/ Billion-scale Approximate Nearest Neighbor S…
![[CVPR20 Tutorial] Billion-scale Approximate Nearest Neighbor Search](https://cdn-ak-scissors.b.st-hatena.com/image/square/320336fc58fb3b4a71760d78a55a07c4d54fd2f5/height=288;version=1;width=512/https%3A%2F%2Ffiles.speakerdeck.com%2Fpresentations%2F41f78b1009374387ba1ec10952921747%2Fslide_0.jpg%3F15679896)
A walk through the SA-IS algorithm - Screwtape's Notepad
A walk through the SA-IS Suffix Array Construction Algorithm¶ Some time ago, while looking for solutions to some string-searching problem I was having, I stumbled across the Suffix Array data-structure. It seemed promising, so I looked up the algorithm Wikipedia recommended (the “SA-IS” algorithm from the paper “Linear Suffix Array Construction by Almost Pure Induced-Sorting” by G. Nong, S. Zhang
DDSketch: A fast and fully-mergeable quantile sketch with relative-error guarantees
Summary statistics such as the mean and variance are easily maintained for large, distributed data streams, but order statistics (i.e., sample quantiles) can only be approximately summarized. There is extensive literature on maintaining quantile sketches where the emphasis has been on bounding the rank error of the sketch while using little memory. Unfortunately, rank error guarantees do not precl
Hash array mapped trie - Wikipedia
This article may be too technical for most readers to understand. Please help improve it to make it understandable to non-experts, without removing the technical details. (October 2019) (Learn how and when to remove this message) A hash array mapped trie[1] (HAMT, /ˈhæmt/) is an implementation of an associative array that combines the characteristics of a hash table and an array mapped trie.[1] It
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.
NEW: Join our DP community in Slack! This repository contains libraries to generate ε- and (ε, δ)-differentially private (DP) statistics over datasets. It contains the following tools: Privacy on Beam is an end-to-end differential privacy framework for Go built on top of Apache Beam. It is intended to be easy to use, even by non-experts. PipelineDP4j is an end-to-end differential privacy framework
Karatsuba algorithm - Wikipedia
Karatsuba multiplication of az+b and cz+d (boxed), and 1234 and 567 with z=100. Magenta arrows denote multiplication, amber denotes addition, silver denotes subtraction and cyan denotes left shift. (A), (B) and (C) show recursion with z=10 to obtain intermediate values. The Karatsuba algorithm is a fast multiplication algorithm for integers. It was discovered by Anatoly Karatsuba in 1960 and publi
Mesh: Compacting Memory Management for C/C++ Applications
Programs written in C/C++ can suffer from serious memory fragmentation, leading to low utilization of memory, degraded performance, and application failure due to memory exhaustion. This paper introduces Mesh, a plug-in replacement for malloc that, for the first time, eliminates fragmentation in unmodified C/C++ applications. Mesh combines novel randomized algorithms with widely-supported virtual
Elias-Fano encoding: 単調増加する数列をほぼ簡潔に表現する - モナドとわたしとコモナド
Haskell Advent Calendar 2018 20日目 単調増加する自然数の列を、最低限のビット数で表現するための興味深いテクニックと、Haskellによる実装を紹介する。 Elias-Fano encoding この手法は、簡潔データ構造に分類されるもの一つであるが、厳密には条件を満たさないため疑似簡潔データ構造と呼ばれる。1970年代、Peter EliasとRobert Mario Fanoによって独立して発見された。 例題として1, 1, 4, 10, 17, 22, 23, 30という列をエンコードしてみよう。まず、それぞれの数を上位3ビットと下位2ビットに分割する。列の長さをNとしたとき、上位のビット数はとする。 上位ビットの列は000 000 001 010 100 101 101 111となる。これをヒストグラムのようにして23個のビンに分ける。 000: 2個
リリース、障害情報などのサービスのお知らせ
最新の人気エントリーの配信
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く
GitHub - felipelouza/gsufsort: gsufsort: building suffix arrays, LCP-arrays and BWTs for string collections [AMB 2020]
GitHub - kurpicz/sais-lite-lcp: Induced Suffix Array and LCP construction based on the SAIS algorithm.
Simple image vectorization
The Algorithms
GitHub - woltapp/blurhash: A very compact representation of a placeholder for an image.
GitHub - orlp/pdqsort: Pattern-defeating quicksort.
GitHub - FastFilter/xorfilter: Go library implementing binary fuse and xor filters
GitHub - thrill/thrill: Thrill - An EXPERIMENTAL Algorithmic Distributed Big Data Batch Processing Framework in C++
Onion Curve: A Space Filling Curve with Near-Optimal Clustering
Copa: Practical Delay-Based Congestion Control for the Internet
GitHub - jermp/opt_vbyte: The code used for the experiments in the paper "Variable-Byte Encoding is Now Space-Efficient Too", by Giulio Ermanno Pibiri and Rossano Venturini.
