598 search results - page 18 / 120 » The Structure of Sparse Resultant Matrices |
147
click to vote
TSP
2012
13 years 11 months ago
2012
This article presents a randomized linear-dispersion space-time block code for decode-andforward synchronous relays. The coding matrices are obtained as a set of columns (or rows)...
251
Voted
NN
2011
Springer
14 years 10 months ago
2011
Springer
In this letter we explore an alternative structural representation for Steinbuch-type binary associative memories. These networks offer very generous storage capacities (both asy...
149
Voted
ICCS
2007
Springer
15 years 10 months ago
2007
Springer
In this paper we deal with performance analysis of Monte Carlo algorithm for large linear algebra problems. We consider applicability and efficiency of the Markov chain Monte Carlo...
135
Voted
COMPUTING
2007
15 years 3 months ago
2007
Hierarchical matrices (H-matrices) approximate matrices in a data-sparse way, and the approximate arithmetic for H-matrices is almost optimal. In this paper we present an algebrai...
158
Voted
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
—We present an alternative analysis of weighted 1 minimization for sparse signals with a nonuniform sparsity model, and extend our results to nuclear norm minimization for matric...