2270 search results - page 20 / 454 » On the distribution of eigenvalues of graphs |
137
Voted
IPCO
1993
15 years 3 months ago
1993
Lower bounds on the bandwidth, the size of a vertex separator of general undirected graphs, and the largest common subgraph of two undirected (weighted) graphs are obtained. The b...
119
click to vote
FOCS
2003
IEEE
15 years 7 months ago
2003
IEEE
We show that random graphs in the preferential connectivity model have constant conductance, and hence have worst-case routing congestion that scales logarithmically with the numb...
92
Voted
TWC
2008
15 years 1 months ago
2008
Abstract--This paper investigates the capacity of multipleaccess and broadcast channels with MIMO-MRC systems in spatially correlated environments. We present new capacity approxim...
109
click to vote
GBRPR
2009
Springer
15 years 8 months ago
2009
Springer
In this paper we propose an inexact spectral matching algorithm that embeds large graphs on a low-dimensional isometric space spanned by a set of eigenvectors of the graph Laplacia...
124
Voted
NIPS
2003
15 years 3 months ago
2003
Spectral methods for nonlinear dimensionality reduction (NLDR) impose a neighborhood graph on point data and compute eigenfunctions of a quadratic form generated from the graph. W...