Foundations
2,177 papers (1 classified directly here)
Subtopics · a paper can sit in several, so these overlap
Papers per year
1
1
1
13
7
16
17
14
29
34
65
54
49
45
81
116
167
207
197
202
208
285
271
97
'5
'10
'15
'20
'25
Papers (including subtopics)
Transformers over Directed Acyclic Graphs
NeurIPS 2023
Ultrafast Euclidean Shortest Path Computation Using Hub Labeling
AAAI 2023
Understand Restart of SAT Solver Using Search Similarity Index (Student Abstract)
AAAI 2023
Unlimiformer: Long-Range Transformers with Unlimited Length Input
NeurIPS 2023
Vanishing Point Estimation in Uncalibrated Images with Prior Gravity Direction
ICCV 2023
VBASE: Unifying Online Vector Similarity Search and Relational Queries via Relaxed Monotonicity
OSDI 2023
Wasserstein Graph Distance Based on L1–Approximated Tree Edit Distance between Weisfeiler–Lehman Subtrees
AAAI 2023
Working Towards Digital Documentation of Uralic Languages With Open-Source Tools and Modern NLP Methods
EMNLP 2023
Worst-case Performance of Popular Approximate Nearest Neighbor Search Implementations: Guarantees and Limitations
NeurIPS 2023
Yes, we CANN: Constrained Approximate Nearest Neighbors for Local Feature-Based Visual Localization
ICCV 2023
Zero-Knowledge Proofs for Classical Planning Problems
AAAI 2023
A*+BFHS: A Hybrid Heuristic Search Algorithm
AAAI 2022
Adapting k-means Algorithms for Outliers
ICML 2022
Adiabatic Quantum Computing for Multi Object Tracking
CVPR 2022
A Fast Local Search Algorithm for the Latin Square Completion Problem
AAAI 2022
A Hybrid Evolutionary Algorithm for the Diversified Top-k Weight Clique Search Problem (Student Abstract)
AAAI 2022
Algorithms for Acyclic Weighted Finite-State Automata with Failure Arcs
EMNLP 2022
Algorithms for Weighted Pushdown Automata
EMNLP 2022
Analysis of Pure Literal Elimination Rule for Non-uniform Random (MAX) k-SAT Problem with an Arbitrary Degree Distribution
AAAI 2022
An Analysis of the Linear Bilateral ANAC Domains Using the MiCRO Benchmark Strategy
IJCAI 2022
A New Framework for Fast Automated Phonological Reconstruction Using Trimmed Alignments and Sound Correspondence Patterns
ACL 2022
An Exact Algorithm with New Upper Bounds for the Maximum k-Defective Clique Problem in Massive Sparse Graphs
AAAI 2022
An Exact MaxSAT Algorithm: Further Observations and Further Improvements
IJCAI 2022
Anytime Multi-Agent Path Finding via Machine Learning-Guided Large Neighborhood Search
AAAI 2022
Anytime-Valid Inference For Multinomial Count Data
NeurIPS 2022