← Foundations
Computer Science › Foundations ›

Algorithms

1295 directly classified papers

Papers per year

Papers

Robust Subspace Approximation in a Stream NIPS 2018
Computing Kantorovich-Wasserstein Distances on $d$-dimensional histograms using $(d+1)$-partite graphs NIPS 2018
A Fast Algorithm for Generalized Arc Consistency of the Alldifferent Constraint IJCAI 2018
Handling implicit and explicit constraints in manipulation planning RSS 2018
Multicomponent 2-D AM-FM Modeling of Speech Spectrograms INTERSPEECH 2018
Out-of-sample extension of graph adjacency spectral embedding ICML 2018
Simple Propagation with Arc-Reversal in Bayesian Networks PGM 2018
Parameterized Algorithms for the Matrix Completion Problem ICML 2018
Finding Minimal Separators in LWF Chain Graphs PGM 2018
Sketching for Kronecker Product Regression and P-splines AISTATS 2018
Proportional Allocation: Simple, Distributed, and Diverse Matching with High Entropy ICML 2018
MISSION: Ultra Large-Scale Feature Selection using Count-Sketches ICML 2018
ASAP: Fast, Approximate Graph Pattern Mining at Scale OSDI 2018
Improving Local Search for Minimum Weight Vertex Cover by Dynamic Strategies IJCAI 2018
OATM: Occlusion Aware Template Matching by Consensus Set Maximization CVPR 2018
Synthesizing Pattern Programs from Examples IJCAI 2018
Learning Optimal Decision Trees with SAT IJCAI 2018
Solving Exist-Random Quantified Stochastic Boolean Satisfiability via Clause Selection IJCAI 2018
Non-metric Similarity Graphs for Maximum Inner Product Search NIPS 2018
Large Vocabulary Concatenative Resynthesis INTERSPEECH 2018
Seeking Practical CDCL Insights from Theoretical SAT Benchmarks IJCAI 2018
Divide and Conquer: Towards Faster Pseudo-Boolean Solving IJCAI 2018
Exact Algorithms and Complexity of Kidney Exchange IJCAI 2018
An Efficient Algorithm To Compute Distance Between Lexicographic Preference Trees IJCAI 2018
Extended Increasing Cost Tree Search for Non-Unit Cost Domains IJCAI 2018