Forschungspapier (740)
10641.
Forschungspapier
Scheduling Lower Bounds via AND Subset Sum. (2020), 14 S.
10642.
Forschungspapier
Fast Gravitational Approach for Rigid Point Set Registration with Ordinary Differential Equations. (2020), 18 S.
10643.
Forschungspapier
Euclidean TSP in Narrow Strips. (2020), 23 S.
10644.
Forschungspapier
Distributed Distance-r Dominating Set on Sparse High-Girth Graphs. (2020), 23 S.
10645.
Forschungspapier
Robust Learning under Strong Noise via SQs. (2020), 21 S.
10646.
Forschungspapier
Secretary and Online Matching Problems with Machine Learned Advice. (2020), 42 S.
10647.
Forschungspapier
On the Approximability of the Traveling Salesman Problem with Line Neighborhoods. (2020), 26 S.
10648.
Forschungspapier
Negative Statements Considered Useful. (2020), 10 S.
10649.
Forschungspapier
Fast and Simple Modular Subset Sum. (2020), 14 S.
10650.
Forschungspapier
X-Fields: Implicit Neural View-, Light- and Time-Image Interpolation. (2020), 15 S.
10651.
Forschungspapier
Examining the Impact of Algorithm Awareness on Wikidata's Recommender System Recoin. (2020), 11 S.
10652.
Forschungspapier
Superposition for Lambda-Free Higher-Order Logic. (2020), 37 S.
10653.
Forschungspapier
MINA: Convex Mixed-Integer Programming for Non-Rigid Shape Alignment. (2020), 14 S.
10654.
Forschungspapier
Combining Implicit Function Learning and Parametric Models for 3D Human Reconstruction. (2020), 18 S.
10655.
Forschungspapier
LoopReg: Self-supervised Learning of Implicit Surface Correspondences, Pose and Shape for 3D Human Mesh Registration. (2020), 18 S.
10656.
Forschungspapier
Towards Query Logs for Privacy Studies: On Deriving Search Queries from Questions. (2020), 16 S.
10657.
Forschungspapier
Physarum Multi-Commodity Flow Dynamics. (2020), 22 S.
10658.
Forschungspapier
Faster Minimization of Tardy Processing Time on a Single Machine. (2020), 12 S.
10659.
Forschungspapier
When Lipschitz Walks Your Dog: Algorithm Engineering of the Discrete Fréchet Distance under Translation. (2020), 26 S.
10660.
Forschungspapier
On Near-Linear-Time Algorithms for Dense Subset Sum. (2020), 36 S.