Skip to content
conftrace_

algorithm optimization

26 papers

Papers

Are Optimal Algorithms Still Optimal? Rethinking Sorting in LLM-Based Pairwise Ranking with Batching and Caching ACL 2025 Exploiting Symmetries in MUS Computation AAAI 2025 Accelerating Non-Maximum Suppression: A Graph Theory Perspective NeurIPS 2024 Faster Differentially Private Top-k Selection: A Joint Exponential Mechanism with Pruning NeurIPS 2024 LibAMM: Empirical Insights into Approximate Computing for Accelerating Matrix Multiplication NeurIPS 2024 When Are Two Lists Better than One?: Benefits and Harms in Joint Decision-Making AAAI 2024 A Fast Algorithm for Computing Prefix Probabilities ACL 2023 Towards Optimal Caching and Model Selection for Large Model Inference NeurIPS 2023 Speeding Up the RUL¯ Dynamic-Controllability-Checking Algorithm for Simple Temporal Networks with Uncertainty AAAI 2022 A Root of a Problem: Optimizing Single-Root Dependency Parsing EMNLP 2021 Fast WordPiece Tokenization EMNLP 2021 Learning Branching Heuristics for Propositional Model Counting AAAI 2021 DWM: A Decomposable Winograd Method for Convolution Acceleration AAAI 2020 Fast MSER CVPR 2020 Efficient Data Point Pruning for One-Class SVM AAAI 2019 Faster Boosting with Smaller Memory NeurIPS 2019 MaxpoolNMS: Getting Rid of NMS Bottlenecks in Two-Stage Object Detectors CVPR 2019 Numerical Optimization to AI, and Back AAAI 2019 Composing Finite State Transducers on GPUs ACL 2018 Improving Online Algorithms via ML Predictions NeurIPS 2018 Faster Conflict Generation for Dynamic Controllability IJCAI 2017 Fast Algorithms for Convolutional Neural Networks CVPR 2016 Efficient Label Propagation ICML 2014 What is the Most Efficient Way to Select Nearest Neighbor Candidates for Fast Approximate Nearest Neighbor Search? ICCV 2013 Automatic online tuning for fast Gaussian summation NeurIPS 2008