Foundations

What Are the Rules? Discovering Constraints from Data AAAI 2024 Why the Metric Backbone Preserves Community Structure NeurIPS 2024 Zeta*-SIPP: Improved Time-Optimal Any-Angle Safe-Interval Path Planning IJCAI 2024 k-Means Clustering with Distance-Based Privacy NeurIPS 2023 3D Registration With Maximal Cliques CVPR 2023 4 and 7-bit Labeling for Projective and Non-Projective Dependency Trees EMNLP 2023 A Bitwise GAC Algorithm for Alldifferent Constraints IJCAI 2023 AC-Band: A Combinatorial Bandit-Based Approach to Algorithm Configuration AAAI 2023 Accelerated and Sparse Algorithms for Approximate Personalized PageRank and Beyond COLT 2023 A Fast Algorithm for Computing Prefix Probabilities ACL 2023 A Formal Perspective on Byte-Pair Encoding ACL 2023 A Framework to Design Approximation Algorithms for Finding Diverse Solutions in Combinatorial Problems AAAI 2023 A Graph-Theoretic Framework for Understanding Open-World Semi-Supervised Learning NeurIPS 2023 A Higher Precision Algorithm for Computing the $1$-Wasserstein Distance ICLR 2023 Algorithm-Hardware Co-Design for Efficient Brain-Inspired Hyperdimensional Learning on Edge (Extended Abstract) IJCAI 2023 Almost Linear Constant-Factor Sketching for ℓ_1 and Logistic Regression ICLR 2023 Analyzing and Improving the Use of the FastMap Embedding in Pathfinding Tasks AAAI 2023 A Nearly-Optimal Bound for Fast Regression with ℓ_∞ Guarantee ICML 2023 An Efficient and Robust Framework for Approximate Nearest Neighbor Search with Attribute Constraint NeurIPS 2023 A new near-linear time algorithm for k-nearest neighbor search using a compressed cover tree ICML 2023 A New Variable Ordering for In-processing Bounded Variable Elimination in SAT Solvers IJCAI 2023 An Exact Poly-Time Membership-Queries Algorithm for Extracting a Three-Layer ReLU Network ICLR 2023 A One-Size-Fits-All Approach to Improving Randomness in Paper Assignment NeurIPS 2023 Approximate Envy-Freeness in Graphical Cake Cutting IJCAI 2023 Approximate Vanishing Ideal Computations at Scale ICLR 2023