Results 61 to 70 of about 206,616 (184)
Hybrid DDoS Detection Framework Using Matching Pursuit Algorithm
Although a considerable amount of research has been done on DDoS attacks, it still poses a severe threat to many businesses and internet service providers. DDoS attacks commonly generate a high amount of network traffic.
Derya Erhan, Emin Anarim
doaj +1 more source
Efficient Distributed Multi-Task Schemes for mmWave MIMO Channel Estimation
In this study, the problem of sparse channel estimation is investigated with the employment of a fully distributed approach. We exploit the spatially joint sparsity structure of the involved channels to formulate the channel estimation problem in the ...
Maria Trigka +2 more
doaj +1 more source
The conventional channel estimation methods based on a preamble for filter bank multicarrier with offset quadrature amplitude modulation (FBMC/OQAM) systems in mobile-to-mobile sensor networks are inefficient.
Han Wang, Wencai Du, Lingwei Xu
doaj +1 more source
Block Multipath Matching Pursuit
In this paper, we propose a new reconstruction algorithm called Block Multipath Matching pursuit (BMMP), which is an extension of multipath matching pursuit (MMP) in block compressed sensing. Then the reconstruction condition of BMMP based on restricted isometric property (RIP) is established. In addition, we also provides a guarantee of reconstruction
Zhou, Jie, Zhang, Pingping
openaire +1 more source
Matching Pursuits with random sequential subdictionaries [PDF]
20 pages - accepted 2nd April 2012 at Elsevier Signal ...
Moussallam, Manuel +2 more
openaire +3 more sources
We show the potential of greedy recovery strategies for the sparse approximation of multivariate functions from a small dataset of pointwise evaluations by considering an extension of the orthogonal matching pursuit to the setting of weighted sparsity ...
A Chkifa +10 more
core +1 more source
One-Bit Compressed Sensing by Greedy Algorithms [PDF]
Sign truncated matching pursuit (STrMP) algorithm is presented in this paper. STrMP is a new greedy algorithm for the recovery of sparse signals from the sign measurement, which combines the principle of consistent reconstruction with orthogonal matching
Gong, Da, Liu, Wenhui, Xu, Zhiqiang
core
Efficient localization of multiple targets is one of the basic technical problems in wireless sensor networks (WSN). The traditional sparse representation method based on greedy class is not efficient in multi-target positioning.
doaj +1 more source
Noisy Subspace Clustering via Matching Pursuits [PDF]
24 pages, 5 ...
Michael Tschannen, Helmut Bolcskei
openaire +2 more sources
Optimization of Matching Pursuit Encoder Based on Analytical Approximation of Matching Pursuit Distortion [PDF]
Distortion of matching pursuit is calculated in terms of matching pursuit encoder parameters for uniformly distributed signals and dictionaries. Then, the MP encoder is optimized using the analytically derived approximation for MP distortion. Our simulation results show that this optimized MP encoder exhibits optimum performance for nonuniform signal ...
Alireza Shoa, Shahram Shirani
openaire +1 more source

