scientific article; zbMATH DE number 5030169
From MaRDI portal
DOI10.1155/IMRN.2005.4019zbMath1103.94014arXivmath/0502299MaRDI QIDQ5471272
R. V. Vershinin, M. V. Rudel'son
Publication date: 6 June 2006
Published in: International Mathematics Research Notices (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0502299
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
(n)-dimensional polytopes (52B11) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Error probability in coding theory (94B70) Coding theorems (Shannon theory) (94A24)
Related Items
Fast \(\ell _{1}\) minimization by iterative thresholding for multidimensional NMR spectroscopy, Sparsity in penalized empirical risk minimization, Random sampling of sparse trigonometric polynomials, A sublinear algorithm for the recovery of signals with sparse Fourier transform when many samples are missing, Centrally symmetric polytopes with many faces, The Dantzig selector and sparsity oracle inequalities, Theory of compressive sensing via \(\ell_1\)-minimization: a non-RIP analysis and extensions, Face numbers: the upper bound side of the story, Restricted isometry property of matrices with independent columns and neighborly polytopes by random sampling, Explicit constructions of centrally symmetric \(k\)-neighborly polytopes and large strictly antipodal sets, Linear regression with sparsely permuted data, Gaussian averages of interpolated bodies and applications to approximate reconstruction, NEIGHBORLINESS OF THE SYMMETRIC MOMENT CURVE, A centrally symmetric version of the cyclic polytope, Reconstruction and subgaussian processes, Sparse-view ultrasound diffraction tomography using compressed sensing with nonuniform FFT, An efficient algorithm based on sparse optimization for the aircraft departure scheduling problem, Linearized Bregman iterations for compressed sensing, Three novel edge detection methods for incomplete and noisy spectral data, Compressive sampling and rapid reconstruction of broadband frequency hopping signals with interference, Counting faces of randomly projected polytopes when the projection radically lowers dimension, Sparse recovery in convex hulls via entropy penalization, Random sampling of sparse trigonometric polynomials. II: Orthogonal matching pursuit versus basis pursuit, Random projections of smooth manifolds, Fast Implementation of ℓ 1-Greedy Algorithm, Outlier deletion based improvement on the stomp algorithm for sparse solution of large-scale underdetermined problems, SYLVESTER–GALLAI TYPE THEOREMS FOR APPROXIMATE COLLINEARITY
