SOTAVerified

graph partitioning

Graph Partitioning is generally the first step of distributed graph computing tasks. The targets are load-balance and minimizing the communication volume.

Papers

Showing 101150 of 208 papers

TitleStatusHype
Node-level Contrastive Unlearning on Graph Neural Networks0
One-step Bipartite Graph Cut: A Normalized Formulation and Its Application to Scalable Subspace Clustering0
On Hash-Based Work Distribution Methods for Parallel Best-First Search0
On the definition of Shape Parts: a Dominant Sets Approach0
Optimizing embedding-related quantum annealing parameters for reducing hardware bias0
Orientation Robust Text Line Detection in Natural Images0
PolicyClusterGCN: Identifying Efficient Clusters for Training Graph Convolutional Networks0
Preconditioned Spectral Clustering for Stochastic Block Partition Streaming Graph Challenge0
Proximity Preserving Binary Code using Signed Graph-Cut0
Quantum Annealing based Power Grid Partitioning for Parallel Simulation0
RANK: AI-assisted End-to-End Architecture for Detecting Persistent Attacks in Enterprise Networks0
Recent Progress on Graph Partitioning Problems Using Evolutionary Computation0
Recursive Decomposition for Nonconvex Optimization0
Regular Intersection Emptiness of Graph Problems: Finding a Needle in a Haystack of Graphs with the Help of Automata0
Regularized Co-Clustering with Dual Supervision0
Reinforcement learning for instance segmentation with high-level priors0
Relations Between Adjacency and Modularity Graph Partitioning0
Replica Symmetry Breaking in Bipartite Spin Glasses and Neural Networks0
Resolution-limit-free and local Non-negative Matrix Factorization quality functions for graph clustering0
Revisiting Graph Construction for Fast Image Segmentation0
Scalable Graph Convolutional Network Training on Distributed-Memory Systems0
Similarity-Driven Semantic Role Induction via Graph Partitioning0
Spectral Clustering with Imbalanced Data0
Spectral Hashing0
Stateless actor-critic for instance segmentation with high-level priors0
Stochastic Blockmodeling for Online Advertising0
Sub-Graph Learning for Spatiotemporal Forecasting via Knowledge Distillation0
SUGAR: Efficient Subgraph-level Training via Resource-aware Graph Partitioning0
Supporting Very Large Models using Automatic Dataflow Graph Partitioning0
The Mutex Watershed: Efficient, Parameter-Free Image Partitioning0
The Semantic Mutex Watershed for Efficient Bottom-Up Semantic Instance Segmentation0
Towards Efficient Large-Scale Graph Neural Network Computing0
Trading Quality for Efficiency of Graph Partitioning: An Inductive Method across Graphs0
Uplifting the Expressive Power of Graph Neural Networks through Graph Partitioning0
VLSI Hypergraph Partitioning with Deep Learning0
WaveGAS: Waveform Relaxation for Scaling Graph Neural Networks0
WawPart: Workload-Aware Partitioning of Knowledge Graphs0
Weighted Laplacian and Its Theoretical Applications0
The Mutex Watershed and its Objective: Efficient, Parameter-Free Graph Partitioning0
xER: An Explainable Model for Entity Resolution using an Efficient Solution for the Clique Partitioning Problem0
3D Cell Nuclei Segmentation with Balanced Graph Partitioning0
A Bayesian Approach To Graph Partitioning0
Accelerating Evolutionary Construction Tree Extraction via Graph Partitioning0
Accelerating Generic Graph Neural Networks via Architecture, Compiler, Partition Method Co-Design0
A Clustering Method with Graph Maximum Decoding Information0
A Design Flow for Mapping Spiking Neural Networks to Many-Core Neuromorphic Hardware0
A Differentiable Approach to Combinatorial Optimization using Dataless Neural Networks0
GASP, a generalized framework for agglomerative clustering of signed graphs and its application to Instance Segmentation0
Agglomeration of Polygonal Grids using Graph Neural Networks with applications to Multigrid solvers0
AGO: Boosting Mobile AI Inference Performance by Removing Constraints on Graph Optimization0
Show:102550
← PrevPage 3 of 5Next →

No leaderboard results yet.