Pages that link to "Item:Q3613658"

The following pages link to Combinatorial Algorithms for Compressed Sensing (Q3613658):

Displaying 22 items.

• Improved constructions for non-adaptive threshold group testing (Q378256) (← links)
• Randomization of data acquisition and \(\ell_{1}\)-optimization (recognition with compression) (Q544714) (← links)
• Combinatorial sublinear-time Fourier algorithms (Q972615) (← links)
• Deterministic \(k\)-set structure (Q975518) (← links)
• A note on compressed sensing and the complexity of matrix multiplication (Q987795) (← links)
• CoSaMP: Iterative signal recovery from incomplete and inaccurate samples (Q1012549) (← links)
• A hierarchical framework for recovery in compressive sensing (Q1693135) (← links)
• Row products of random matrices (Q1759375) (← links)
• Strengthening hash families and compressive sensing (Q1932362) (← links)
• A sample efficient sparse FFT for arbitrary frequency candidate sets in high dimensions (Q2118948) (← links)
• Generalized framework for group testing: queries, feedbacks and adversaries (Q2136279) (← links)
• Compressed sensing with sparse binary matrices: instance optimal error guarantees in near-optimal time (Q2252137) (← links)
• Low-weight superimposed codes and related combinatorial structures: bounds and applications (Q2285161) (← links)
• Improved sparse Fourier approximation results: Faster implementations and stronger guarantees (Q2376358) (← links)
• Sparse Recovery with Partial Support Knowledge (Q3088079) (← links)
• Sketching with Kerdock's Crayons: Fast Sparsifying Transforms for Arbitrary Linear Maps (Q5088658) (← links)
• Inferring Sparse Preference Lists from Partial Information (Q5141707) (← links)
• Static Risk-Based Group Testing Schemes Under Imperfectly Observable Risk (Q5141708) (← links)
• (Q5743468) (← links)
• (Q5743471) (← links)
• Subquadratic non-adaptive threshold group testing (Q5919529) (← links)
• Simple Codes and Sparse Recovery with Fast Decoding (Q6101016) (← links)