scientific article; zbMATH DE number 7376004

DOI10.4230/LIPIcs.ICALP.2018.77zbMath1499.68369arXiv1609.08739MaRDI QIDQ5002756

Sepideh Mahabadi, Sariel Har-Peled, Piotr Indyk

Publication date: 28 July 2021

Full work available at URL: https://arxiv.org/abs/1609.08739

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

sparse recoverysparse linear regressionapproximate nearest neighbornearest induced flatnearest subspace search

Mathematics Subject Classification ID

Linear regression; mixed models (62J05) Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05) Approximation algorithms (68W25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Better lower bounds on detecting affine and spherical degeneracies
• An optimal algorithm for approximate nearest neighbor searching fixed dimensions
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• Atomic Decomposition by Basis Pursuit
• Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces
• Regression Shrinkage and Selection via The Lasso: A Retrospective
• Sparse Approximate Solutions to Linear Systems
• Approximate Nearest Line Search in High Dimensions
• Compressed sensing
• Adaptive greedy approximations

This page was built for publication: