2270 search results - page 25 / 454 » On the distribution of eigenvalues of graphs |
PARA
1994
Springer
15 years 6 months ago
1994
Springer
In this paper we present four parallel algorithms to compute any group of eigenvalues and eigenvectors of a Toeplitz-plus-Hankel matrix. These algorithms parallelize a method that...
110
click to vote
GLOBECOM
2006
IEEE
15 years 8 months ago
2006
IEEE
— In this paper, we propose serially concatenated trellis coded modulations (SCTCMs) that perform consistently close to the available mutual information for the 2-by-2 compound m...
138
Voted
RSA
2010
15 years 8 days ago
2010
We study here the spectra of random lifts of graphs. Let G be a finite connected graph, and let the infinite tree T be its universal cover space. If λ1 and ρ are the spectral ...
144
Voted
SIBGRAPI
2006
IEEE
15 years 8 months ago
2006
IEEE
In this paper, we present a novel method for estimating the effective number of independent variables in imaging applications that require multiple hypothesis testing. The method ...
122
click to vote
PR
2008
15 years 1 months ago
2008
In this paper, we make a study on three Linear Discriminant Analysis (LDA) based methods: Regularized Discriminant Analysis (RDA), Discriminant Common Vectors (DCV) and Maximal Ma...