← Foundations
Computer Science › Foundations ›

Algorithms

1295 directly classified papers

Papers per year

Papers

Identifying Bottlenecks in Practical SAT-Based Model Finding for First-Order Logic Ontologies with Datasets AAAI 2019
FilterReg: Robust and Efficient Probabilistic Point-Set Registration Using Gaussian Filter and Twist Parameterization CVPR 2019
Optimal Surveillance of Covert Networks by Minimizing Inverse Geodesic Length AAAI 2019
Detection of Planted Solutions for Flat Satisfiability Problems AISTATS 2019
Very Hard Electoral Control Problems AAAI 2019
A Recursive Algorithm for Projected Model Counting AAAI 2019
A Polynomial-time Solution for Robust Registration with Extreme Outlier Rates RSS 2019
Adaptive Estimation for Approximate $k$-Nearest-Neighbor Computations AISTATS 2019
Learnability of Solutions to Conjunctive Queries JMLR 2019
Near Optimal Frequent Directions for Sketching Dense and Sparse Matrices JMLR 2019
BIRD: Engineering an Efficient CNF-XOR SAT Solver and Its Applications to Approximate Model Counting AAAI 2019
Don't take it lightly: Phasing optical random projections with unknown operators NIPS 2019
Optimal Sparse Decision Trees NIPS 2019
Turkish Treebanking: Unifying and Constructing Efforts ACL 2019
Total Least Squares Regression in Input Sparsity Time NIPS 2019
SySCD: A System-Aware Parallel Coordinate Descent Algorithm NIPS 2019
Towards Near-imperceptible Steganographic Text ACL 2019
Perturbation Analysis of the 8-Point Algorithm: A Case Study for Wide FoV Cameras CVPR 2019
K-Nearest Neighbors Hashing CVPR 2019
Query-focused Sentence Compression in Linear Time EMNLP 2019
Re-randomized Densification for One Permutation Hashing and Bin-wise Consistent Weighted Sampling NIPS 2019
Random Projections with Asymmetric Quantization NIPS 2019
Finding Minimal d-separators in Linear Time and Applications UAI 2019
A Better Algorithm for Societal Tradeoffs AAAI 2019
Correlation clustering with local objectives NIPS 2019