Forschungspapier (740)
10821.
Forschungspapier
Video Based Reconstruction of 3D People Models. (2018), 11 S.
10822.
Forschungspapier
Detailed Human Avatars from Monocular Video. (2018), 12 S.
10823.
Forschungspapier
A PTAS for Euclidean TSP with Hyperplane Neighborhoods. (2018), 21 S.
10824.
Forschungspapier
Improved Bounds on Fourier Entropy and Min-entropy. (2018), 38 S.
10825.
Forschungspapier
A Fast Implementation of Near Neighbors Queries for Fréchet Distance (GIS Cup). (2018), 9 S.
10826.
Forschungspapier
The Geometry of Rank Decompositions of Matrix Multiplication II: 3 x 3 Matrices. (2018), 29 S.
10827.
Forschungspapier
A PTAS for l p-Low Rank Approximation. (2018), 61 S.
10828.
Forschungspapier
Finding a Bounded-Degree Expander Inside a Dense One. (2018), 21 S.
10829.
Forschungspapier
Synchronisation of Partial Multi-Matchings via Non-negative Factorisations. (2018), 18 S.
10830.
Forschungspapier
Higher-order Projected Power Iterations for Scalable Multi-Matching. (2018), 10 S.
10831.
Forschungspapier
Bayesian Prediction of Future Street Scenes through Importance Sampling based Optimization. (2018), 14 S.
10832.
Forschungspapier
cISP: A Speed-of-Light Internet Service Provider. (2018), 15 S.
10833.
Forschungspapier
Equity of Attention: Amortizing Individual Fairness in Rankings. (2018), 10 S.
10834.
Forschungspapier
Dissecting Latency in the Internet's Fiber Infrastructure. (2018), 15 S.
10835.
Forschungspapier
Maximum Volume Subset Selection for Anchored Boxes. (2018), 25 S.
10836.
Forschungspapier
Multivariate Analysis of Orthogonal Range Searching and Graph Distances Parameterized by Treewidth. (2018), 18 S.
10837.
Forschungspapier
Multivariate Fine-Grained Complexity of Longest Common Subsequence. (2018), 66 S.
10838.
Forschungspapier
Fréchet Distance Under Translation: Conditional Hardness and an Algorithm via Offline Dynamic Grid Reachability. (2018), 40 S.
10839.
Forschungspapier
Sketching, Streaming, and Fine-Grained Complexity of (Weighted) LCS. (2018), 16 S.
10840.
Forschungspapier
Clique-Based Lower Bounds for Parsing Tree-Adjoining Grammars. (2018), 15 S.