Skip to content
conftrace_

Algorithms

1,701 papers

1
8
38
163
200
'5
'10
'15
'20
'25

Papers

On the Computational Tractability of the (Many) Shapley Values AISTATS 2025 On the Modelling of Constraints with Tractable Logical Operators AAAI 2025 On the Recovery of Cameras from Fundamental Matrices ICCV 2025 On Tractability of Learning Bayesian Networks with Ancestral Constraints AISTATS 2025 On Tradeoffs in Learning-Augmented Algorithms AISTATS 2025 Optimal Capacity Modification for Stable Matchings with Ties IJCAI 2025 Optimal Metric Distortion for Matching on the Line IJCAI 2025 Optimal Robust Estimation under Local and Global Corruptions: Stronger Adversary and Smaller Error COLT 2025 Optimal Time Complexity Algorithms for Computing General Random Walk Graph Kernels on Sparse Graphs AISTATS 2025 Order-One Rolling Shutter Cameras CVPR 2025 Parallel Greedy Best-First Search with a Bound on Expansions Relative to Sequential Search AAAI 2025 Pareto-Optimality, Smoothness, and Stochasticity in Learning-Augmented One-Max-Search ICML 2025 Physiome-ODE: A Benchmark for Irregularly Sampled Multivariate Time-Series Forecasting Based on Biological ODEs ICLR 2025 Planar Affine Rectification from Local Change of Scale and Orientation ICCV 2025 Polynomial Time Learning Augmented Algorithms for NP-hard Permutation Problems ICML 2025 Practical Solutions to the Relative Pose of Three Calibrated Cameras CVPR 2025 Pre-Assignment Problem for Unique Minimum Vertex Cover on Bounded Clique-Width Graphs AAAI 2025 Predicting quantum channels over general product distributions COLT 2025 Prediction-Based Adaptive Variable Ordering Heuristics for Constraint Satisfaction Problems AAAI 2025 Prepacking: A Simple Method for Fast Prefilling and Increased Throughput in Large Language Models AISTATS 2025 Prices, Bids, Values: One ML-Powered Combinatorial Auction to Rule Them All ICML 2025 Procurement Auctions via Approximately Optimal Submodular Optimization ICML 2025 Proportionally Fair Makespan Approximation AAAI 2025 Proven Approximation Guarantees in Multi-Objective Optimization: SPEA2 Beats NSGA-II IJCAI 2025 Pure and Strong Nash Equilibrium Computation in Compactly Representable Aggregate Games UAI 2025