← Foundations
Computer Science › Foundations ›

Algorithms

1295 directly classified papers

Papers per year

Papers

Efficient Heuristic Search for M-Modes Inference PGM 2020
A determinantal point process for column subset selection JMLR 2020
Scikit-network: Graph Analysis in Python JMLR 2020
Best-first Enumeration Based on Bounding Conflicts, and its Application to Large-scale Hybrid Estimation (Extended Abstract) IJCAI 2020
A Cardinal Improvement to Pseudo-Boolean Solving AAAI 2020
Norm-Explicit Quantization: Improving Vector Quantization for Maximum Inner Product Search AAAI 2020
Efficient Algorithms for Generating Provably Near-Optimal Cluster Descriptors for Explainability AAAI 2020
Explaining Propagators for String Edit Distance Constraints AAAI 2020
Practical Frank–Wolfe Method with Decision Diagrams for Computing Wardrop Equilibrium of Combinatorial Congestion Games AAAI 2020
Envelope-Based Approaches to Real-Time Heuristic Search AAAI 2020
Deciding Acceptance in Incomplete Argumentation Frameworks AAAI 2020
Learning Optimal Decision Trees Using Caching Branch-and-Bound Search AAAI 2020
Fast and Efficient Boolean Matrix Factorization by Geometric Segmentation AAAI 2020
Task and Motion Planning Is PSPACE-Complete AAAI 2020
Measuring Mutual Information Between All Pairs of Variables in Subquadratic Complexity AISTATS 2020
Microsecond Consensus for Microsecond Applications OSDI 2020
Byzantine Ordered Consensus without Byzantine Oligarchy OSDI 2020
Testing Database Engines via Pivoted Query Synthesis OSDI 2020
G-TAD: Sub-Graph Localization for Temporal Action Detection CVPR 2020
Bounds in query learning COLT 2020
Tiramisu: Fast Multilayer Network Verification NSDI 2020
Diamond-Miner: Comprehensive Discovery of the Internet's Topology Diamonds NSDI 2020
Batchy: Batch-scheduling Data Flow Graphs with Service-level Objectives NSDI 2020
VMscatter: A Versatile MIMO Backscatter NSDI 2020
Plankton: Scalable network configuration verification through model checking NSDI 2020