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:
- Efficient graph clustering software for normalized cut and ratio association on undirected graphs. Copyright(c) 2008 Brian Kulis, Yuqiang…☆22Updated 13 years ago
- Deep Learning framework in C++/CUDA that supports symbolic/automatic differentiation, dynamic computation graphs, tensor/matrix operation…☆54Updated 3 years ago
- SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index☆55Updated 10 years ago
- Implements the frequent directions algorithm for approximating matrices in streams☆32Updated 7 years ago
- C implementation of algorithms to find the Density-Friendly graph decomposition☆11Updated 5 years ago
- Neural LSH [ICLR 2020] - Using supervised learning to produce better space partitions for fast nearest neighbor search.☆72Updated 4 years ago
- Quickly compute all maximal cliques of a graph☆80Updated 6 years ago
- Parallel k-core Decomposition on Multicore Platforms☆11Updated 4 years ago
- Parallel network flows using OpenMP and CUDA.☆28Updated 6 years ago
- Artifacts for SOSP'19 paper Optimizing Deep Learning Computation with Automatic Generation of Graph Substitutions☆21Updated 3 years ago
- HogWild++: A New Mechanism for Decentralized Asynchronous Stochastic Gradient Descent☆33Updated 8 years ago
- Fast search algorithm for product-quantized codes via hash-tables☆53Updated 7 years ago
- Large Scale Graphical Model☆24Updated 6 years ago
- MXNet - nGraph integration☆34Updated 3 years ago
- Implementation of fast exact k-means algorithms☆45Updated 5 years ago
- Distributed NMF/NTF Library☆47Updated 7 months ago
- NetworkX Addon to allow graph partitioning with METIS☆79Updated 2 years ago
- [ICLR 2019] Learning Representations of Sets through Optimized Permutations☆36Updated 6 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…☆69Updated 6 years ago
- Efficient LDA solution on GPUs.☆24Updated 6 years ago
- High-Performance Streaming Graph Analytics on GPUs☆33Updated 6 years ago
- A Distributed Multi-GPU System for Fast Graph Processing☆65Updated 6 years ago
- Source files and notebooks for a paper on accelerating HDBSCAN*☆33Updated 7 years ago
- fast kernel evaluation in high dimensions via hashing☆23Updated 4 years ago
- Library for performing spectral clustering in C++☆78Updated 2 years ago
- Codes for the paper "Deep Neural Networks with Multi-Branch Architectures Are Less Non-Convex"☆20Updated 4 years ago
- Solving LPs with convergent message passing☆66Updated 2 years ago
- CUDA Sparse-Matrix Vector Multiplication, using Sliced Coordinate format☆22Updated 7 years ago
- CoreScope: Graph Mining Using k-Core Analysis - Patterns, Anomalies and Algorithms (ICDM'16 & KAIS'18)☆16Updated 8 months ago
- Cartesian k-means for approximate nearest neghbor search, codebook learning, etc.☆51Updated 11 years ago