approximate algorithm

On Finding Hubs in High Dimensions with Sampling AAAI 2025 Sample Complexity of Correlation Detection in the Gaussian Wigner Model ICML 2025 Simple Path Structural Encoding for Graph Transformers ICML 2025 An Approximate Skolem Function Counter AAAI 2024 Auditable Algorithms for Approximate Model Counting AAAI 2024 Arya: Arbitrary Graph Pattern Mining with Decomposition-based Sampling NSDI 2023 Differentially Private Approximate Near Neighbor Counting in High Dimensions NeurIPS 2023 Fast Converging Anytime Model Counting AAAI 2023 Computational Analyses of the Electoral College: Campaigning Is Hard But Approximately Manageable AAAI 2021 Exact and approximate hierarchical clustering using A* UAI 2021 Fusion Moves for Graph Matching ICCV 2021 Mechanism Design for Facility Location Problems: A Survey IJCAI 2021 Stochastic $L^\natural$-convex Function Minimization NeurIPS 2021 A Novel Approach for Constrained Optimization in Graphical Models NeurIPS 2020 Optimal Common Contract with Heterogeneous Agents AAAI 2020 A Bandit Approach to Maximum Inner Product Search AAAI 2019 Adaptive Estimation for Approximate k-Nearest-Neighbor Computations AISTATS 2019 Scalable Fair Clustering ICML 2019 Comparing Approximate Relaxations of Envy-Freeness IJCAI 2018 Computing an Approximately Optimal Agreeable Set of Items IJCAI 2017 Scalable Discrete Sampling as a Multi-Armed Bandit Problem ICML 2016 Simple and Efficient Weighted Minwise Hashing NeurIPS 2016 Practical and Optimal LSH for Angular Distance NeurIPS 2015 A Fast Approximate AIB Algorithm for Distributional Word Clustering CVPR 2013 b-Bit Minwise Hashing for Estimating Three-Way Similarities NeurIPS 2010