← Foundations
Computer Science › Foundations ›

Algorithms

1295 directly classified papers

Papers per year

Papers

What Are the Rules? Discovering Constraints from Data AAAI 2024
EGODE: An Event-attended Graph ODE Framework for Modeling Rigid Dynamics NIPS 2024
Deep Homomorphism Networks NIPS 2024
Link Prediction for Flow-Driven Spatial Networks WACV 2024
Seeded Graph Matching for the Correlated Gaussian Wigner Model via the Projected Power Method JMLR 2024
Even Sparser Graph Transformers NIPS 2024
Pygmtools: A Python Graph Matching Toolkit JMLR 2024
Clustering with Non-adaptive Subset Queries NIPS 2024
ProG: A Graph Prompt Learning Benchmark NIPS 2024
skscope: Fast Sparsity-Constrained Optimization in Python JMLR 2024
Popular and Dominant Matchings with Uncertain and Multimodal Preferences IJCAI 2024
Epistemic Logic Programs: Non-Ground and Counting Complexity IJCAI 2024
Functionally Constrained Algorithm Solves Convex Simple Bilevel Problem NIPS 2024
Planning for Temporally Extended Goals in Pure-Past Linear Temporal Logic (Extended Abstract) IJCAI 2024
A robust inlier identification algorithm for point cloud registration via $\mathbf{\ell_0}$-minimization NIPS 2024
A Tensor-Based Formalization of the Event Calculus IJCAI 2024
Learning on Large Graphs using Intersecting Communities NIPS 2024
Practical Shuffle Coding NIPS 2024
Sequential Signal Mixing Aggregation for Message Passing Graph Neural Networks NIPS 2024
Source Code is a Graph, Not a Sequence: A Cross-Lingual Perspective on Code Clone Detection NAACL 2024
Random Subgraph Detection Using Queries JMLR 2024
Importance Matching Lemma for Lossy Compression with Side Information AISTATS 2024
HOPE: Shape Matching Via Aligning Different K-hop Neighbourhoods NIPS 2024
Scalable Algorithms for Individual Preference Stable Clustering AISTATS 2024
Equivalence Testing: The Power of Bounded Adaptivity AISTATS 2024