8669 search results - page 137 / 1734 » Computing matrix representations |
FCCM
2007
IEEE
13 years 11 months ago
2007
IEEE
Creating a high throughput sparse matrix vector multiplication (SpMxV) implementation depends on a balanced system design. In this paper, we introduce the innovative SpMxV Solver ...
CIKM
2010
Springer
13 years 7 months ago
2010
Springer
Matrix factorization methods are among the most common techniques for detecting latent components in data. Popular examples include the Singular Value Decomposition or Nonnegative...
CORR
2012
Springer
12 years 4 months ago
2012
Springer
The notions of subgraph centrality and communicability, based on the exponential of the adjacency matrix of the underlying graph, have been effectively used in the analysis of und...
DSP
2006
13 years 9 months ago
2006
In this paper we describe a method for simultaneously estimating the direction of arrival (DOA) of the signal along with its unknown frequency. In a typical DOA estimation problem...
COMBINATORICS
2007
13 years 9 months ago
2007
Each m by m symmetric matrix M over 0, 1, ∗, defines a partition problem, in which an input graph G is to be partitioned into m parts with adjacencies governed by M, in the sen...