Skip to main navigation
Skip to search
Skip to main content
Ben-Gurion University Research Portal Home
Help & FAQ
Home
Profiles
Research output
Research units
Prizes
Press/Media
Student theses
Activities
Research Labs / Equipment
Datasets
Projects
Search by expertise, name or affiliation
Efficient Computation of MSE Lower Bounds via Matching Pursuit
Shahar Sar Shalom,
Joseph Tabrikian
Department of Electrical & Computer Engineering
Research output
:
Contribution to journal
›
Article
›
peer-review
4
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Efficient Computation of MSE Lower Bounds via Matching Pursuit'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Efficient Computation
100%
Error Bound
100%
Matching Pursuit
100%
Projection-based
100%
Tight
25%
Tight Bounds
25%
Computational Complexity
25%
Optimization Procedure
25%
Computational Resources
25%
Non-Bayesian
25%
Multidimensional Optimization
25%
Non-Bayesian Approach
25%
Weiss-Weinstein Bound
25%
Covariance Inequality
25%
Unified Formulation
25%
Multi-tone
25%
Generalized Orthogonal Matching Pursuit (gOMP)
25%
Quasi-greedy Basis
25%
Computer Science
Approximation (Algorithm)
100%
Computational Complexity
100%
Orthogonal Matching Pursuit
100%
Computational Resource
100%
Matching Pursuit
100%
Efficient Computation
100%
Bayesian Approach
100%
Engineering
Error Bound
100%
Matching Pursuit
100%
Computational Complexity
25%
Orthogonal Matching Pursuit
25%
Computational Resource
25%
Optimisation Procedure
25%
Bayesian Approach
25%