Popular GitHub Repositories for Partition

A distributed approximate nearest neighborhood search (ANN) library which provides a high quality vector index build, search and distributed online serving toolkits for large scale vector search scenario.

?? LLaMA-MoE: Building Mixture-of-Experts from LLaMA with Continual Pre-training (EMNLP 2024)

Official PyTorch implementation of Superpoint Transformer introduced in [ICCV'23] "Efficient 3D Semantic Segmentation with Superpoint Transformer" and SuperCluster introduced in [3DV'24 Oral] "Scalable 3D Panoptic Segmentation As Superpoint Graph Clustering"

Large-scale Point Cloud Semantic Segmentation with Superpoint Graphs

Create a 130GB Nix ️store in GitHub runners ❄️ Multi-partition BTRFS RAID-0 for /nix ? Brutally purges unnecessary software ? Dynamically grows the Nix store ?

[AAAI 2024] GLOP: Learning Global Partition and Local Construction for Solving Large-scale Routing Problems in Real-time

[MLSys 2022] "BNS-GCN: Efficient Full-Graph Training of Graph Convolutional Networks with Partition-Parallelism and Random Boundary Node Sampling" by Cheng Wan, Youjie Li, Ang Li, Nam Sung Kim, Yingyan Lin

一个用于可视化层级数据的交互式分区/冰柱图表网页组件

Physics-inspired transformer modules based on mean-field dynamics of vector-spin models in JAX

Source code for our AAAI 2020 paper P-SIF: Document Embeddings using Partition Averaging

Official codebase for "Quantile Reward Policy Optimization: Alignment with Pointwise Regression and Exact Partition Functions" (Matrenok et al. 2025).

Including W2V, DistMult, CP, SimplE, ComplEx, RotatE, Quaternion, MEI, MEIM. Paper: MEIM: Multi-partition Embedding Interaction Beyond Block Term Format for Efficient and Expressive Link Prediction (IJCAI 2022).

Implementation of approximate free-energy minimization in PyTorch

A Python package for construction and analysis of ordinal partition networks from time-series data.

Code database with the implementation of MSE-CNN, from the paper "DeepQTMT: A Deep Learning Approach for Fast QTMT-based CU Partition of Intra-mode VVC".

Incrementally partition data into `k` clusters.

This project simulates the Multiple Partitions - Variable Regions memory management technique, also known as MVT ( Multiprogramming with Variable number of Tasks) in IBM machines. It demonstrates the behavior of MVT memory management in a simulated environment.

Here are some scientific programing code. quick-sort, Max-Sat, 3-k Partition, k-D tree, search greedy using immperative, objected oriented and structured, funcional and procedural programming language paradgms