{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/task/compressed-sensing/papers/10","list_of":"/task/compressed-sensing","task":"compressed sensing","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":10,"pages_in_order":10,"rows_per_page":100,"rows":[901,992],"of":992,"counts":{"archive_papers_tagged":992,"with_a_code_link":246,"where_syntology_ran_a_sample":27,"not_listed_spam_title":0,"listed":992,"listed_where_code_ran":27,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":25,"every_run_a_failure_of_syntologys_instrument":2,"listed_with_a_run_with_no_instrument_failure":25,"listed_every_run_a_failure_of_syntologys_instrument":2,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/task/compressed-sensing","prev":"/task/compressed-sensing/papers/9","next":null,"papers":[{"url":null,"slug":"ring-artifacts-correction-in-compressed","title":"Ring artifacts correction in compressed sensing tomographic reconstruction","date":"2015-02-05","arxiv_id":"1502.01480","repositories_listed":0,"syntology":null},{"url":null,"slug":"parallel-magnetic-resonance-imaging","title":"Parallel Magnetic Resonance Imaging","date":"2015-01-25","arxiv_id":"1501.06209","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-blind-compressed-sensing-using","title":"Efficient Blind Compressed Sensing Using Sparsifying Transforms with Convergence Guarantees and Application to MRI","date":"2015-01-13","arxiv_id":"1501.02923","repositories_listed":0,"syntology":null},{"url":null,"slug":"quantile-universal-threshold-model-selection","title":"Quantile universal threshold: model selection at the detection edge for high-dimensional linear regression","date":"2014-12-05","arxiv_id":"1412.1927","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-structured-matrix-rank-minimization","title":"Efficient Structured Matrix Rank Minimization","date":"2014-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"predicting-useful-neighborhoods-for-lazy","title":"Predicting Useful Neighborhoods for Lazy Local Learning","date":"2014-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"two-new-approaches-to-compressed-sensing","title":"Two New Approaches to Compressed Sensing Exhibiting Both Robust Sparse Recovery and the Grouping Effect","date":"2014-10-30","arxiv_id":"1410.8229","repositories_listed":0,"syntology":null},{"url":null,"slug":"compressed-sensing-with-very-sparse-gaussian","title":"Compressed Sensing with Very Sparse Gaussian Random Projections","date":"2014-08-11","arxiv_id":"1408.2504","repositories_listed":0,"syntology":null},{"url":null,"slug":"graphlab-a-new-framework-for-parallel-machine-1","title":"GraphLab: A New Framework For Parallel Machine Learning","date":"2014-08-09","arxiv_id":"1408.2041","repositories_listed":0,"syntology":null},{"url":null,"slug":"matrix-coherence-and-the-nystrom-method","title":"Matrix Coherence and the Nystrom Method","date":"2014-08-09","arxiv_id":"1408.2044","repositories_listed":0,"syntology":null},{"url":null,"slug":"compressed-sensing-for-longitudinal-mri-an","title":"Compressed sensing for longitudinal MRI: An adaptive-weighted approach","date":"2014-07-10","arxiv_id":"1407.2602","repositories_listed":0,"syntology":null},{"url":null,"slug":"info-greedy-sequential-adaptive-compressed","title":"Info-Greedy sequential adaptive compressed sensing","date":"2014-07-02","arxiv_id":"1407.0731","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-new-path-to-construct-parametric","title":"A New Path to Construct Parametric Orientation Field: Sparse FOMFE Model and Compressed Sparse FOMFE Model","date":"2014-07-01","arxiv_id":"1407.0342","repositories_listed":0,"syntology":null},{"url":null,"slug":"compressive-imaging-and-characterization-of","title":"Compressive Imaging and Characterization of Sparse Light Deflection Maps","date":"2014-06-25","arxiv_id":"1406.6425","repositories_listed":0,"syntology":null},{"url":null,"slug":"structured-dictionary-learning-for","title":"Structured Dictionary Learning for Classification","date":"2014-06-08","arxiv_id":"1406.1943","repositories_listed":0,"syntology":null},{"url":null,"slug":"deformation-corrected-compressed-sensing-dc","title":"Deformation corrected compressed sensing (DC-CS): a novel framework for accelerated dynamic MRI","date":"2014-05-29","arxiv_id":"1405.7718","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-computational-intractability-of-exact","title":"On the Computational Intractability of Exact and Approximate Dictionary Learning","date":"2014-05-26","arxiv_id":"1405.6664","repositories_listed":0,"syntology":null},{"url":null,"slug":"randomized-sketches-of-convex-programs-with","title":"Randomized Sketches of Convex Programs with Sharp Guarantees","date":"2014-04-29","arxiv_id":"1404.7203","repositories_listed":0,"syntology":null},{"url":null,"slug":"spatiotemporal-sparse-bayesian-learning-with","title":"Spatiotemporal Sparse Bayesian Learning with Applications to Compressed Sensing of Multichannel Physiological Signals","date":"2014-04-21","arxiv_id":"1404.5122","repositories_listed":0,"syntology":null},{"url":null,"slug":"geometric-inference-for-general-high","title":"Geometric Inference for General High-Dimensional Linear Inverse Problems","date":"2014-04-17","arxiv_id":"1404.4408","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-sparse-kaczmarz-solver-and-a-linearized","title":"A sparse Kaczmarz solver and a linearized Bregman method for online compressed sensing","date":"2014-03-28","arxiv_id":"1403.7543","repositories_listed":0,"syntology":null},{"url":null,"slug":"compressive-hyperspectral-imaging-using","title":"Compressive Hyperspectral Imaging Using Progressive Total Variation","date":"2014-03-07","arxiv_id":"1403.1697","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-primal-dual-active-set-with-continuation","title":"A Primal Dual Active Set with Continuation Algorithm for the \\ell^0-Regularized Optimization Problem","date":"2014-03-03","arxiv_id":"1403.0515","repositories_listed":0,"syntology":null},{"url":null,"slug":"machine-learning-methods-in-the-computational","title":"Machine Learning Methods in the Computational Biology of Cancer","date":"2014-02-24","arxiv_id":"1402.5728","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-convergence-proof-of-the-split-bregman","title":"A convergence proof of the split Bregman method for regularized least-squares problems","date":"2014-02-18","arxiv_id":"1402.4371","repositories_listed":0,"syntology":null},{"url":null,"slug":"sparsity-averaging-for-radio-interferometric","title":"Sparsity averaging for radio-interferometric imaging","date":"2014-02-11","arxiv_id":"1402.2335","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-low-dose-x-ray-ct-reconstruction","title":"Efficient Low Dose X-ray CT Reconstruction through Sparsity-Based MAP Modeling","date":"2014-02-08","arxiv_id":"1402.1801","repositories_listed":0,"syntology":null},{"url":null,"slug":"near-ideal-behavior-of-compressed-sensing","title":"Near-Ideal Behavior of Compressed Sensing Algorithms","date":"2014-01-26","arxiv_id":"1401.6623","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-terminal-probabilistic-compressed","title":"Multi Terminal Probabilistic Compressed Sensing","date":"2014-01-11","arxiv_id":"1401.2569","repositories_listed":0,"syntology":null},{"url":null,"slug":"sparse-recovery-with-very-sparse-compressed","title":"Sparse Recovery with Very Sparse Compressed Counting","date":"2013-12-31","arxiv_id":"1401.0201","repositories_listed":0,"syntology":null},{"url":null,"slug":"recursive-compressed-sensing","title":"Recursive Compressed Sensing","date":"2013-12-17","arxiv_id":"1312.4895","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimization-for-compressed-sensing-the","title":"Optimization for Compressed Sensing: the Simplex Method and Kronecker Sparsification","date":"2013-12-16","arxiv_id":"1312.4426","repositories_listed":0,"syntology":null},{"url":null,"slug":"precise-semidefinite-programming-formulation","title":"Precise Semidefinite Programming Formulation of Atomic Norm Minimization for Recovering d-Dimensional ($d\\geq 2$) Off-the-Grid Frequencies","date":"2013-12-02","arxiv_id":"1312.0485","repositories_listed":0,"syntology":null},{"url":null,"slug":"blind-calibration-in-compressed-sensing-using","title":"Blind Calibration in Compressed Sensing using Message Passing Algorithms","date":"2013-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-learning-and-planning-with","title":"Efficient Learning and Planning with Compressed Predictive States","date":"2013-12-01","arxiv_id":"1312.0286","repositories_listed":0,"syntology":null},{"url":null,"slug":"sparse-nonnegative-deconvolution-for","title":"Sparse nonnegative deconvolution for compressive calcium imaging: algorithms and phase transitions","date":"2013-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-compressed-sensing-under-matrix","title":"Robust Compressed Sensing Under Matrix Uncertainties","date":"2013-11-20","arxiv_id":"1311.4924","repositories_listed":0,"syntology":null},{"url":null,"slug":"compressed-sensing-for-energy-efficient","title":"Compressed Sensing for Energy-Efficient Wireless Telemonitoring: Challenges and Opportunities","date":"2013-11-15","arxiv_id":"1311.3995","repositories_listed":0,"syntology":null},{"url":null,"slug":"toward-a-unified-theory-of-sparse","title":"Toward a unified theory of sparse dimensionality reduction in Euclidean space","date":"2013-11-11","arxiv_id":"1311.2542","repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-compressed-sensing-and-sparse-coding","title":"Robust Compressed Sensing and Sparse Coding with the Difference Map","date":"2013-10-31","arxiv_id":"1311.0053","repositories_listed":0,"syntology":null},{"url":null,"slug":"compressed-sensing-sar-imaging-with-multilook","title":"Compressed Sensing SAR Imaging with Multilook Processing","date":"2013-10-27","arxiv_id":"1310.7217","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-novel-progressive-image-scanning-and","title":"A Novel Progressive Image Scanning and Reconstruction Scheme based on Compressed Sensing and Linear Prediction","date":"2013-10-04","arxiv_id":"1310.1259","repositories_listed":0,"syntology":null},{"url":null,"slug":"spatially-scalable-compressed-image-sensing","title":"Spatially Scalable Compressed Image Sensing with Hybrid Transform and Inter-layer Prediction Model","date":"2013-10-04","arxiv_id":"1310.1221","repositories_listed":0,"syntology":null},{"url":null,"slug":"compressed-counting-meets-compressed-sensing","title":"Compressed Counting Meets Compressed Sensing","date":"2013-10-03","arxiv_id":"1310.1076","repositories_listed":0,"syntology":null},{"url":null,"slug":"scan-based-compressed-terahertz-imaging-and","title":"Scan-based Compressed Terahertz Imaging and Real-Time Reconstruction via the Complex-valued Fast Block Sparse Bayesian Learning Algorithm","date":"2013-09-20","arxiv_id":"1309.6195","repositories_listed":0,"syntology":null},{"url":null,"slug":"photon-counting-compressive-depth-mapping","title":"Photon counting compressive depth mapping","date":"2013-09-17","arxiv_id":"1309.4385","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimized-projections-for-compressed-sensing-1","title":"Optimized projections for compressed sensing via rank-constrained nearest correlation matrix","date":"2013-09-14","arxiv_id":"1309.3676","repositories_listed":0,"syntology":null},{"url":null,"slug":"compressed-sensing-for-block-sparse-smooth","title":"Compressed Sensing for Block-Sparse Smooth Signals","date":"2013-09-10","arxiv_id":"1309.2505","repositories_listed":0,"syntology":null},{"url":null,"slug":"demodulation-of-sparse-ppm-signals-with-low","title":"Demodulation of Sparse PPM Signals with Low Samples Using Trained RIP Matrix","date":"2013-09-01","arxiv_id":"1309.5854","repositories_listed":0,"syntology":null},{"url":null,"slug":"compressed-sensing-off-the-grid","title":"Compressed Sensing Off the Grid","date":"2013-08-07","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"online-optimization-in-dynamic-environments-1","title":"Online Optimization in Dynamic Environments","date":"2013-07-23","arxiv_id":"1307.5944","repositories_listed":0,"syntology":null},{"url":null,"slug":"universally-elevating-the-phase-transition","title":"Universally Elevating the Phase Transition Performance of Compressed Sensing: Non-Isometric Matrices are Not Necessarily Bad Matrices","date":"2013-07-17","arxiv_id":"1307.4502","repositories_listed":0,"syntology":null},{"url":null,"slug":"regularized-spherical-polar-fourier-diffusion","title":"Regularized Spherical Polar Fourier Diffusion MRI with Optimal Dictionary Learning","date":"2013-07-02","arxiv_id":"1307.0776","repositories_listed":0,"syntology":null},{"url":null,"slug":"short-term-memory-capacity-in-networks-via","title":"Short Term Memory Capacity in Networks via the Restricted Isometry Property","date":"2013-07-01","arxiv_id":"1307.7970","repositories_listed":0,"syntology":null},{"url":null,"slug":"compressive-coded-aperture-keyed-exposure","title":"Compressive Coded Aperture Keyed Exposure Imaging with Optical Flow Reconstruction","date":"2013-06-26","arxiv_id":"1306.6281","repositories_listed":0,"syntology":null},{"url":null,"slug":"near-optimal-adaptive-compressed-sensing","title":"Near-Optimal Adaptive Compressed Sensing","date":"2013-06-26","arxiv_id":"1306.6239","repositories_listed":0,"syntology":null},{"url":null,"slug":"precisely-verifying-the-null-space-conditions","title":"Precisely Verifying the Null Space Conditions in Compressed Sensing: A Sandwiching Algorithm","date":"2013-06-11","arxiv_id":"1306.2665","repositories_listed":0,"syntology":null},{"url":null,"slug":"sparse-representation-of-a-polytope-and","title":"Sparse Representation of a Polytope and Recovery of Sparse Signals and Low-rank Matrices","date":"2013-06-05","arxiv_id":"1306.1154","repositories_listed":0,"syntology":null},{"url":null,"slug":"compressed-hashing","title":"Compressed Hashing","date":"2013-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"corrupted-sensing-novel-guarantees-for","title":"Corrupted Sensing: Novel Guarantees for Separating Structured Signals","date":"2013-05-11","arxiv_id":"1305.2524","repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-spectral-compressed-sensing-via","title":"Robust Spectral Compressed Sensing via Structured Matrix Completion","date":"2013-04-30","arxiv_id":"1304.8126","repositories_listed":0,"syntology":null},{"url":null,"slug":"spectral-compressed-sensing-via-structured","title":"Spectral Compressed Sensing via Structured Matrix Completion","date":"2013-04-16","arxiv_id":"1304.4610","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-problem-dependent-analysis-of-socp","title":"A problem dependent analysis of SOCP algorithms in noisy compressed sensing","date":"2013-03-29","arxiv_id":"1304.0480","repositories_listed":0,"syntology":null},{"url":null,"slug":"sample-distortion-for-compressed-imaging","title":"Sample Distortion for Compressed Imaging","date":"2013-03-22","arxiv_id":"1303.5492","repositories_listed":0,"syntology":null},{"url":null,"slug":"multiclass-data-segmentation-using-diffuse","title":"Multiclass Data Segmentation using Diffuse Interface Methods on Graphs","date":"2013-02-15","arxiv_id":"1302.3913","repositories_listed":0,"syntology":null},{"url":null,"slug":"bayesian-nonparametric-dictionary-learning","title":"Bayesian Nonparametric Dictionary Learning for Compressed Sensing MRI","date":"2013-02-12","arxiv_id":"1302.2712","repositories_listed":0,"syntology":null},{"url":null,"slug":"coherence-and-sufficient-sampling-densities","title":"Coherence and sufficient sampling densities for reconstruction in compressed sensing","date":"2013-02-12","arxiv_id":"1302.2767","repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-image-reconstruction-from-multi-view","title":"Robust image reconstruction from multi-view measurements","date":"2012-12-13","arxiv_id":"1212.3268","repositories_listed":0,"syntology":null},{"url":null,"slug":"approximate-message-passing-with-consistent","title":"Approximate Message Passing with Consistent Parameter Estimation and Applications to Sparse Learning","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"feature-clustering-for-accelerating-parallel","title":"Feature Clustering for Accelerating Parallel Coordinate Descent","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"multilabel-classification-using-bayesian","title":"Multilabel Classification using Bayesian Compressed Sensing","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"near-optimal-compressed-sensing-guarantees","title":"Near-optimal compressed sensing guarantees for total variation minimization","date":"2012-10-11","arxiv_id":"1210.3098","repositories_listed":0,"syntology":null},{"url":null,"slug":"recovering-block-structured-activations-using","title":"Recovering Block-structured Activations Using Compressive Measurements","date":"2012-09-15","arxiv_id":"1209.3431","repositories_listed":0,"syntology":null},{"url":null,"slug":"group-iterative-spectrum-thresholding-for","title":"Group Iterative Spectrum Thresholding for Super-Resolution Sparse Spectral Selection","date":"2012-07-28","arxiv_id":"1207.6684","repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-dequantized-compressive-sensing","title":"Robust Dequantized Compressive Sensing","date":"2012-07-03","arxiv_id":"1207.0577","repositories_listed":0,"syntology":null},{"url":null,"slug":"compressed-sensing-of-eeg-for-wireless","title":"Compressed Sensing of EEG for Wireless Telemonitoring with Low Energy Consumption and Inexpensive Hardware","date":"2012-06-13","arxiv_id":"1206.3493","repositories_listed":0,"syntology":null},{"url":null,"slug":"compressed-sensing-for-energy-efficient-1","title":"Compressed Sensing for Energy-Efficient Wireless Telemonitoring of Noninvasive Fetal ECG via Block Sparse Bayesian Learning","date":"2012-05-07","arxiv_id":"1205.1287","repositories_listed":0,"syntology":null},{"url":null,"slug":"dimensionality-reduction-using-the-sparse","title":"Dimensionality Reduction Using the Sparse Linear Model","date":"2011-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"neural-reconstruction-with-approximate","title":"Neural Reconstruction with Approximate Message Passing (NeuRAMP)","date":"2011-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"orthogonal-matching-pursuit-with-replacement","title":"Orthogonal Matching Pursuit with Replacement","date":"2011-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"universal-low-rank-matrix-recovery-from-pauli","title":"Universal low-rank matrix recovery from Pauli measurements","date":"2011-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"compressed-sensing-of-astronomical-images","title":"Compressed sensing of astronomical images:orthogonal wavelets domains","date":"2011-11-27","arxiv_id":"1111.6276","repositories_listed":0,"syntology":null},{"url":null,"slug":"joint-reconstruction-of-multiecho-mr-images","title":"Joint reconstruction of multiecho MR images using correlated sparsity","date":"2011-05-14","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"tensor-completion-and-low-n-rank-tensor","title":"Tensor completion and low-n-rank tensor recovery via convex optimization","date":"2011-02-24","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"probabilistic-multi-task-feature-selection","title":"Probabilistic Multi-Task Feature Selection","date":"2010-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"short-term-memory-in-neuronal-networks","title":"Short-term memory in neuronal networks through dynamical compressed sensing","date":"2010-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"task-driven-dictionary-learning","title":"Task-Driven Dictionary Learning","date":"2010-09-27","arxiv_id":"1009.5358","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-functions-of-few-arbitrary-linear","title":"Learning Functions of Few Arbitrary Linear Parameters in High Dimensions","date":"2010-08-18","arxiv_id":"1008.3043","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-achievability-of-cramer-rao-bound-in","title":"On the Achievability of Cramér-Rao Bound In Noisy Compressed Sensing","date":"2010-06-13","arxiv_id":"1006.2513","repositories_listed":0,"syntology":null},{"url":null,"slug":"asymptotic-analysis-of-map-estimation-via-the","title":"Asymptotic Analysis of MAP Estimation via the Replica Method and Compressed Sensing","date":"2009-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"speeding-up-magnetic-resonance-image","title":"Speeding up Magnetic Resonance Image Acquisition by Bayesian Multi-Slice Adaptive Compressed Sensing","date":"2009-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"an-homotopy-algorithm-for-the-lasso-with","title":"An Homotopy Algorithm for the Lasso with Online Observations","date":"2008-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null}],"record_sha256":"b9ccfb513bebca3e9c9a56d2cab02bd01822f36a979c5435af67d76b7c5ad2fa","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}