← Foundations
Computer Science › Foundations ›

Algorithms

1295 directly classified papers

Papers per year

Papers

Maintenance of Case Bases: Current Algorithms after Fifty Years IJCAI 2018
The FastMap Algorithm for Shortest Path Computations IJCAI 2018
Computational Social Choice Meets Databases IJCAI 2018
Parallel and Streaming Algorithms for K-Core Decomposition ICML 2018
Learning to Branch ICML 2018
Generalized Binary Search For Split-Neighborly Problems AISTATS 2018
Dynamic Fair Division Problem with General Valuations IJCAI 2018
An Exact Algorithm for Maximum k-Plexes in Massive Graphs IJCAI 2018
Self-Bounded Prediction Suffix Tree via Approximate String Matching ICML 2018
A Fast Algorithm for Optimally Finding Partially Disjoint Shortest Paths IJCAI 2018
Generating Plans for Cooperative Connected UAVs IJCAI 2018
Local Density Estimation in High Dimensions ICML 2018
Provably Correct Automatic Sub-Differentiation for Qualified Programs NIPS 2018
Computing Higher Order Derivatives of Matrix and Tensor Expressions NIPS 2018
Maximum Selection and Sorting with Adversarial Comparators JMLR 2018
Training Gaussian Mixture Models at Scale via Coresets JMLR 2018
Provably Correct Algorithms for Matrix Column Subset Selection with Selectively Sampled Data JMLR 2018
Efficient Bandit Combinatorial Optimization Algorithm with Zero-suppressed Binary Decision Diagrams AISTATS 2018
Multi-frame Coding of LSF Parameters Using Block-Constrained Trellis Coded Vector Quantization INTERSPEECH 2018
Simpler and Faster Algorithm for Checking the Dynamic Consistency of Conditional Simple Temporal Networks IJCAI 2018
Spectrally Approximating Large Graphs with Smaller Graphs ICML 2018
Novel Structural Parameters for Acyclic Planning Using Tree Embeddings IJCAI 2018
Functional Partitioning of Ontologies for Natural Language Query Completion in Question Answering Systems IJCAI 2018
Coded Sparse Matrix Multiplication ICML 2018
Coordinate Descent with Bandit Sampling NIPS 2018