CORR
2011
Springer
12 years 11 months ago
2011
Springer
Abstract. Consider a weighted and undirected graph, possibly with self-loops, and its corresponding Laplacian matrix, possibly augmented with additional diagonal elements correspon...
CORR
2010
Springer
13 years 3 months ago
2010
Springer
Spectral analysis has been successfully applied to the detection of community structure of networks, respectively being based on the adjacency matrix, the standard Laplacian matrix...
JCP
2006
13 years 4 months ago
2006
The present paper proposes new approaches for recommendation tasks based on one-class support vector machines (1-SVMs) with graph kernels generated from a Laplacian matrix. We intr...
JCT
2008
13 years 4 months ago
2008
Let M denote the Laplacian matrix of a graph G. Associated with G is a finite group (G), obtained from the Smith normal form of M, and whose order is the number of spanning trees o...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
It is well-known that the eigenvalue spectrum of the Laplacian matrix of a network contains valuable information about the network structure and the behavior of many dynamical proc...
CDC
2009
IEEE
13 years 9 months ago
2009
IEEE
— In this paper, we investigate synchronization in a small-world network of coupled nonlinear oscillators. This network is constructed by introducing random shortcuts in a neares...
SPAA
2005
ACM
13 years 10 months ago
2005
ACM
In 1995, Gremban, Miller, and Zagha introduced supporttree preconditioners and a parallel algorithm called supporttree conjugate gradient (STCG) for solving linear systems of the ...
ICPR
2008
IEEE
13 years 11 months ago
2008
IEEE
Maximum Margin Criterion (MMC) based Feature Extraction method is more efficient than LDA for calculating the discriminant vectors since it does not need to calculate the inverse ...