Algorithms

Spectral Sensitivity Estimation with an Uncalibrated Diffraction Grating ICCV 2025 Speedup Techniques for Switchable Temporal Plan Graph Optimization AAAI 2025 Streaming Algorithms For ℓ_p Flows and ℓ_p Regression ICLR 2025 Streaming Multi-agent Pathfinding IJCAI 2025 Suboptimal Search with Dynamic Distribution of Suboptimality AAAI 2025 Symbolic Functional Decomposition: A Reconfiguration Approach AAAI 2025 System-Aware Unlearning Algorithms: Use Lesser, Forget Faster ICML 2025 Testing Juntas and Junta Subclasses with Relative Error COLT 2025 The Complexity of Extending Fair Allocations of Indivisible Goods AAAI 2025 The Computational Complexity of Positive Non-Clashing Teaching in Graphs ICLR 2025 The Impact of Literal Sorting on Cardinality Constraint Encodings AAAI 2025 The Limits of Tractable Marginalization ICML 2025 Theoretically Grounded Pruning of Large Ground Sets for Constrained, Discrete Optimization AISTATS 2025 The Ramanujan Library - Automated Discovery on the Hypergraph of Integer Relations ICLR 2025 Three-view Focal Length Recovery From Homographies CVPR 2025 Tintin: A Unified Hardware Performance Profiling Infrastructure to Uncover and Manage Uncertainty OSDI 2025 Towards Projected and Incremental Pseudo-Boolean Model Counting AAAI 2025 Towards Real-Time Approximate Counting AAAI 2025 Towards the 30 by 30 Kunming-Montreal Global Biodiversity Framework Target: Optimising Graph Connectivity in Constraint-Based Spatial Planning IJCAI 2025 TurboReg: TurboClique for Robust and Efficient Point Cloud Registration ICCV 2025 Unify ML4TSP: Drawing Methodological Principles for TSP and Beyond from Streamlined Design Space of Learning and Search ICLR 2025 Weighted Poisson-disk Resampling on Large-Scale Point Clouds AAAI 2025 When Can We Solve the Weighted Low Rank Approximation Problem in Truly Subquadratic Time? AISTATS 2025 WINS: Winograd Structured Pruning for Fast Winograd Convolution ICCV 2025 Accelerating ERM for data-driven algorithm design using output-sensitive techniques NeurIPS 2024