ZHENG Yuxin's repositories
ann-benchmarks
Benchmarks of approximate nearest neighbor libraries in Python
annoy
Approximate Nearest Neighbors in C++/Python optimized for memory usage and loading/saving to disk
code-samples
Source code examples from the Parallel Forall Blog
cracking-the-coding-interview
Solutions for the book: Cracking the coding interview V4. Written in C++.
CUDA
GPU-accelerated LIBSVM is a modification of the original LIBSVM that exploits the CUDA framework to significantly reduce processing time while producing identical results. The functionality and interface of LIBSVM remains the same. The modifications were done in the kernel computation, that is now performed using the GPU.
dkm
A generic C++11 k-means clustering implementation
free-programming-books-zh_CN
免费的计算机编程类中文书籍,欢迎投稿
hnsw
Hnsw paper code for 200M SIFT experiment
kmcuda
Large scale K-means implementation on NVIDIA GPU / CUDA
leetcode-1
LeetCode题解,151道题完整版
n2
TOROS N2 - lightweight approximate Nearest Neighbor library which runs faster even with large datasets
rtb-papers
A collection of research and survey papers of real-time bidding (RTB) based display advertising techniques.