Foundations

Improved Error Bounds for Tree Representations of Metric Spaces NeurIPS 2016 Iterative Hessian Sketch: Fast and Accurate Solution Approximation for Constrained Least-Squares JMLR 2016 Joint M-Best-Diverse Labelings as a Parametric Submodular Minimization NeurIPS 2016 Kinematic Structure Correspondences via Hypergraph Matching CVPR 2016 LazySVD: Even Faster SVD Decomposition Yet Without Agonizing Pain NeurIPS 2016 Low-Rank Approximation of Weighted Tree Automata AISTATS 2016 Normalized Spectral Map Synchronization NeurIPS 2016 On Valid Optimal Assignment Kernels and Applications to Graph Classification NeurIPS 2016 Optimal Relative Pose With Unknown Correspondences CVPR 2016 Orthogonal Random Features NeurIPS 2016 Phrase-based Machine Translation using Multiple Preordering Candidates COLING 2016 Principal Component Projection Without Principal Component Analysis ICML 2016 Privacy Odometers and Filters: Pay-as-you-Go Composition NeurIPS 2016 Querying Data Graphs with Arithmetical Regular Expressions IJCAI 2016 Simple and Efficient Weighted Minwise Hashing NeurIPS 2016 Single Pass PCA of Matrix Products NeurIPS 2016 SPALS: Fast Alternating Least Squares via Implicit Leverage Scores Sampling NeurIPS 2016 Speeding up k-means by approximating Euclidean distances via block vectors ICML 2016 Sublinear Time Orthogonal Tensor Decomposition NeurIPS 2016 Succinct Data Structures for NLP-at-Scale COLING 2016 TensorFlow: A System for Large-Scale Machine Learning OSDI 2016 Tensor Power Iteration for Multi-Graph Matching CVPR 2016 The Chordal Graph Polytope for Learning Decomposable Models PGM 2016 The Global Patch Collider CVPR 2016 The Product Cut NeurIPS 2016