Algorithms

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 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 Approximating CKY with Transformers EMNLP 2023 A Refined Upper Bound and Inprocessing for the Maximum K-plex Problem IJCAI 2023 A Regular Matching Constraint for String Variables IJCAI 2023 A Robust and Opponent-Aware League Training Method for StarCraft II NeurIPS 2023 A Scalable Framework for Table of Contents Extraction from Complex ESG Annual Reports EMNLP 2023 AutoCoreset: An Automatic Practical Coreset Construction Framework ICML 2023 Automating Nearest Neighbor Search Configuration with Constrained Optimization ICLR 2023 Automating Rigid Origami Design IJCAI 2023 Average Sensitivity of Decision Tree Learning ICLR 2023 Ballot Length in Instant Runoff Voting AAAI 2023