yuj-umd / fastscLinks
A fast implementation of spectral clustering on GPU-CPU Platform
☆32Updated 7 years ago
Alternatives and similar repositories for fastsc
Users that are interested in fastsc are comparing it to the libraries listed below
Sorting:
- Subsampled Graph-Based DBSCAN☆11Updated 5 years ago
- Quickly compute all maximal cliques of a graph☆80Updated 7 years ago
- Deep Learning framework in C++/CUDA that supports symbolic/automatic differentiation, dynamic computation graphs, tensor/matrix operation…☆53Updated 4 years ago
- Neural LSH [ICLR 2020] - Using supervised learning to produce better space partitions for fast nearest neighbor search.☆73Updated 4 years ago
- Solving LPs with convergent message passing☆67Updated 2 years ago
- [NeurIPS 2019 Spotlight] High dimensional mean estimation and outlier detection in nearly-linear time.☆26Updated 6 years ago
- C implementation of algorithms to find the Density-Friendly graph decomposition☆11Updated 5 years ago
- Efficient graph clustering software for normalized cut and ratio association on undirected graphs. Copyright(c) 2008 Brian Kulis, Yuqiang…☆22Updated 13 years ago
- Code for ICML2019 paper: Learning to Route in Similarity Graphs☆59Updated last year
- NetworkX Addon to allow graph partitioning with METIS☆80Updated 2 years ago
- Efficient LSH-based kernel density estimation☆29Updated 6 years ago
- IPC: A Graph Data Set Compiled from International Planning Competitions☆46Updated 6 years ago
- Fast Fast Hadamard Transform☆86Updated 3 years ago
- Implements the frequent directions algorithm for approximating matrices in streams☆33Updated 8 years ago
- SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index☆55Updated 10 years ago
- A framework for index based similarity search.☆19Updated 6 years ago
- A convolutional neural network for graph classification in PyTorch☆91Updated 6 years ago
- Implementations of several fast approximate algorithms for geometric optimal transport (OT)☆116Updated 5 years ago
- Fast search algorithm for product-quantized codes via hash-tables☆53Updated 7 years ago
- Large Scale Graphical Model☆24Updated 6 years ago
- Distributed NMF/NTF Library☆51Updated 11 months ago
- Parallel network flows using OpenMP and CUDA.☆28Updated 7 years ago
- A fork of Sebastian Nowozin's and Koji Tsuda's gboost code☆17Updated 12 years ago
- A clustering algorithm that first finds the high-density regions (cluster-cores) of the data and then clusters the remaining points by hi…☆70Updated 7 years ago
- Cartesian k-means for approximate nearest neghbor search, codebook learning, etc.☆51Updated 12 years ago
- ☆14Updated 3 years ago
- A well-documented C++ implementation of the cover tree datastructure for quick k-nearest-neighbor search. Allows single-point insertion a…☆62Updated 7 years ago
- [ICLR 2019] Learning Representations of Sets through Optimized Permutations☆36Updated 6 years ago
- Implementation of HNSW that supports online updates☆68Updated 7 years ago
- Parallel Maximum Clique Library☆118Updated 2 years ago