Skip to content
conftrace_

Papers (including subtopics)

Dynamical Models and tracking regret in online convex programming ICML 2013 Dynamic Scaled Sampling for Deterministic Constraints AISTATS 2013 Efficient 3D Endfiring TRUS Prostate Segmentation with Globally Optimized Rotational Symmetry CVPR 2013 Efficient and Robust Large-Scale Rotation Averaging ICCV 2013 Efficient Dimensionality Reduction for Canonical Correlation Analysis ICML 2013 Efficient Higher-Order Clustering on the Grassmann Manifold ICCV 2013 Efficient Learning of Simplices COLT 2013 Efficient Optimization for Sparse Gaussian Process Regression NeurIPS 2013 Efficient Sparse Group Feature Selection via Nonconvex Optimization ICML 2013 Elastic Net Constraints for Shape Matching ICCV 2013 Embed and Project: Discrete Sampling with Universal Hashing NeurIPS 2013 Enhanced Continuous Tabu Search for Parameter Estimation in Multiview Geometry ICCV 2013 Enhanced statistical rankings via targeted data collection ICML 2013 Error-Minimizing Estimates and Universal Entry-Wise Error Bounds for Low-Rank Matrix Completion NeurIPS 2013 Estimating Unknown Sparsity in Compressed Sensing ICML 2013 Estimation of Extreme Values and Associated Level Sets of a Regression Function via Selective Sampling COLT 2013 Estimation, Optimization, and Parallelism when Data is Sparse NeurIPS 2013 EVSAC: Accelerating Hypotheses Generation by Modeling Matching Scores with Extreme Value Theory ICCV 2013 Exact and Stable Recovery of Pairwise Interaction Tensors NeurIPS 2013 Exemplar-Based Graph Matching for Robust Facial Landmark Localization ICCV 2013 Expensive Function Optimization with Stochastic Binary Outcomes ICML 2013 Experiment Selection for Causal Discovery JMLR 2013 Exploration vs Exploitation vs Safety: Risk-Aware Multi-Armed Bandits ACML 2013 Fantope Projection and Selection: A near-optimal convex relaxation of sparse PCA NeurIPS 2013 Fast Algorithms for Gaussian Noise Invariant Independent Component Analysis NeurIPS 2013