نتایج جستجو برای: sparse non

تعداد نتایج: 1367563  

Journal: :IEEE Signal Processing Letters 2021

The direction of arrival (DOA) estimation problem is addressed in this letter. A reconfigurable intelligent surface (RIS) aided system for the DOA proposed. Unlike traditional systems, a low-cost with only one complete functional receiver given by changing phases reflected signals at RIS elements to realize multiple measurements. Moreover, an atomic norm-based method proposed exploiting target ...

Background: Microarray experiments can simultaneously determine the expression of thousands of genes. Identification of potential genes from microarray data for diagnosis of cancer is important. This study aimed to identify genes for the diagnosis of acute myeloid and lymphoblastic leukemia using a sparse feature selection method. Materials and Methods: In this descriptive study, the expressio...

2014
Chen Wang Yong Fang Zhi-Chao Sheng

Non Wide Sense Stationary Uncorrelated Scattering (Non-WSSUS) is one of characteristics for high-speed railway wireless channels. In this paper, estimation of Non-WSSUS Channel for OFDM Systems is considered by using Compressive Sensing (CS) method. Given sufficiently wide transmission bandwidth, wireless channels encountered here tend to exhibit a sparse multipath structure. Then a sparse Non-...

2018
Aditya Bhaskara Silvio Lattanzi

We consider the problems of sparse regression and column subset selection under `1 error. For both problems, we show that in the non-negative setting it is possible to obtain tight and efficient approximations, without any additional structural assumptions (such as restricted isometry, incoherence, expansion, etc.). For sparse regression, given A, b with non-negative entries, we give an efficie...

Journal: :Chemometrics and Intelligent Laboratory Systems 2020

Journal: :Proceedings of the ... AAAI Conference on Artificial Intelligence 2021

Many applications of machine learning on discrete domains, such as preference functions in recommender systems or auctions, can be reduced to estimating a set function that is sparse the Fourier domain. In this work, we present new family algorithms for Fourier-sparse functions. They require at most nk − k log + queries (set evaluations), under mild conditions coefficients, where n size ground ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید