← Foundations
Computer Science › Foundations ›

Algorithms

1295 directly classified papers

Papers per year

Papers

Group Decision Diagram (GDD): A Compact Representation for Permutations AAAI 2019
Bringing Order to Chaos – A Compact Representation of Partial Order in SAT-Based HTN Planning AAAI 2019
Sliding Window Temporal Graph Coloring AAAI 2019
Fast Relational Probabilistic Inference and Learning: Approximate Counting via Hypergraphs AAAI 2019
A Robust and Efficient Algorithm for the PnL Problem Using Algebraic Distance to Approximate the Reprojection Distance AAAI 2019
Efficient Solving of Birds of a Feather Puzzles AAAI 2019
Symmetry-Breaking Constraints for Grid-Based Multi-Agent Path Finding AAAI 2019
Anytime Recursive Best-First Search for Bounding Marginal MAP AAAI 2019
Sampling Sketches for Concave Sublinear Functions of Frequencies NIPS 2019
Decomposed Local Models for Coordinate Structure Parsing NAACL 2019
Crowdsourcing via Pairwise Co-occurrences: Identifiability and Algorithms NIPS 2019
Möbius Transformation for Fast Inner Product Search on Graph NIPS 2019
SPoC: Search-based Pseudocode to Code NIPS 2019
DiskANN: Fast Accurate Billion-point Nearest Neighbor Search on a Single Node NIPS 2019
Towards a Zero-One Law for Column Subset Selection NIPS 2019
G2SAT: Learning to Generate SAT Formulas NIPS 2019
Subquadratic High-Dimensional Hierarchical Clustering NIPS 2019
A Tree-Based Method for Fast Repeated Sampling of Determinantal Point Processes ICML 2019
Coresets for Ordered Weighted Clustering ICML 2019
Adaptive Hashing for Model Counting UAI 2019
Direct Universal Access: Making Data Center Resources Available to FPGA NSDI 2019
(Nearly) Efficient Algorithms for the Graph Matching Problem on Correlated Random Graphs NIPS 2019
Exact Sampling of Directed Acyclic Graphs from Modular Distributions UAI 2019
An Improved Hierarchical Datastructure for Nearest Neighbor Search AAAI 2019
Rotational Diversity in Multi-Cycle Assignment Problems AAAI 2019