conftrace_
← Foundations
Computer Science › Foundations ›

Algorithms

1,298 papers

Papers per year

1
6
27
149
97
'05
'10
'15
'20
'25

Papers

Tintin: A Unified Hardware Performance Profiling Infrastructure to Uncover and Manage Uncertainty OSDI 2025
Fast and Synchronous Crash Consistency with Metadata Write-Once File System OSDI 2025
Decentralized, Epoch-based F2FS Journaling with Fine-grained Crash Recovery OSDI 2025
Neural Graph Map: Dense Mapping with Efficient Loop Closure Integration WACV 2025
3D Edge Sketch from Multiview Images WACV 2025
A Conic Transformation Approach for Solving the Perspective-Three-Point Problem WACV 2025
Adversarially Robust Dense-Sparse Tradeoffs via Heavy-Hitters NIPS 2024
HOPE: Shape Matching Via Aligning Different K-hop Neighbourhoods NIPS 2024
Warm-starting Push-Relabel NIPS 2024
Barely Random Algorithms and Collective Metrical Task Systems NIPS 2024
Learning Plaintext-Ciphertext Cryptographic Problems via ANF-based SAT Instance Representation NIPS 2024
LinNet: Linear Network for Efficient Point Cloud Representation Learning NIPS 2024
On the cohesion and separability of average-link for hierarchical agglomerative clustering NIPS 2024
Efficient Centroid-Linkage Clustering NIPS 2024
Euclidean distance compression via deep random features NIPS 2024
Deep Homomorphism Networks NIPS 2024
Clustering with Non-adaptive Subset Queries NIPS 2024
Learning on Large Graphs using Intersecting Communities NIPS 2024
Functionally Constrained Algorithm Solves Convex Simple Bilevel Problem NIPS 2024
Challenges of Generating Structurally Diverse Graphs NIPS 2024
EGODE: An Event-attended Graph ODE Framework for Modeling Rigid Dynamics NIPS 2024
Navigable Graphs for High-Dimensional Nearest Neighbor Search: Constructions and Limits NIPS 2024
Opponent Modeling based on Subgoal Inference NIPS 2024
HardCore Generation: Generating Hard UNSAT Problems for Data Augmentation NIPS 2024
A robust inlier identification algorithm for point cloud registration via $\mathbf{\ell_0}$-minimization NIPS 2024