Skip to main navigation
Skip to search
Skip to main content
Bar-Ilan University Home
Help & FAQ
Link opens in a new tab
Search content at Bar-Ilan University
Home
Researchers
Organisations
Research output
Prizes
Student theses
Courses
Activities
Projects
Press/Media
Datasets
Equipment
For-all sparse recovery in near-optimal time
Anna C. Gilbert
, Yi Li
,
Ely Porat
, Martin J. Strauss
Department of Computer Science and Artificial Intelligence
University of Michigan, Ann Arbor
Nanyang Technological University
Research output
:
Contribution to journal
›
Article
›
peer-review
22
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'For-all sparse recovery in near-optimal time'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
1-measurement
50%
Corruption
25%
Decoding Algorithm
25%
Deterministic Algorithm
25%
Expander
25%
Expander Graphs
25%
Hashing
100%
Improved Algorithm
25%
K Parameter
25%
L1-norm
25%
Linear Algorithm
25%
List-recovery
25%
Location Index
25%
Long Messages
50%
Near-optimal
100%
Network Coding
25%
Number of Measurements
25%
Overall Architecture
25%
Probabilistic Method
25%
Recovery Algorithm
100%
Recovery System
100%
Single Matrix
25%
Sparse Recovery
100%
Sublinear Algorithms
25%
Superlinear
25%
Top Level
25%
Two-layer
25%
Varying Parameters
25%
Weak Recovery
50%
Computer Science
Approximation (Algorithm)
25%
Decoding Algorithm
25%
Encoding Procedure
25%
Hashing
75%
Hashing Layer
25%
Network Coding
25%
Position Signal
25%
Probabilistic Method
25%
Recovery Algorithm
100%
Recovery System
100%