7930 search results - page 272 / 1586 » Greedy in Approximation Algorithms |
185
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
Due to multipath delay spread and relatively high sampling rate in OFDM systems, the channel estimation is formulated as a sparse recovery problem, where a hybrid compressed sensi...
150
click to vote
DATE
2002
IEEE
15 years 11 months ago
2002
IEEE
Deterministic observation and random excitation of fault sites during the ATPG process dramatically reduces the overall defective part level. However, multiple observations of eac...
201
click to vote
TEC
2008
15 years 6 months ago
2008
In general, the analysis of microarray data requires two steps: feature selection and classification. From a variety of feature selection methods and classifiers, it is difficult t...
254
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
In the past decade there has been a great interest in a synthesis-based model for signals, based on sparse and redundant representations. Such a model assumes that the signal of i...
178
click to vote
DAWAK
2005
Springer
16 years 3 days ago
2005
Springer
A biclustering algorithm, based on a greedy technique and enriched with a local search strategy to escape poor local minima, is proposed. The algorithm starts with an initial rando...