1039 search results - page 32 / 208 » Kernels and Regularization on Graphs |
110
Voted
COMBINATORICS
2004
15 years 10 days ago
2004
It is shown that if a d-regular graph contains s vertices so that the distance between any pair is at least 4k, then its adjacency matrix has at least s eigenvalues which are at l...
112
Voted
ALGORITHMICA
2011
14 years 7 months ago
2011
We investigate the natural situation of the dissemination of information on various graph classes starting with a random set of informed vertices called active. Initially active ve...
89
Voted
DM
2007
15 years 14 days ago
2007
Krishnamoorthy, Thulasiraman and Swamy [Minimum order graphs with specified diameter, connectivity and regularity, Networks 19 (1989) 25–46] showed that a δ-regular graph with...
122
click to vote
NIPS
2004
15 years 1 months ago
2004
This paper investigates the effect of Kernel Principal Component Analysis (KPCA) within the classification framework, essentially the regularization properties of this dimensional...
119
click to vote
EDBT
2009
ACM
15 years 5 months ago
2009
ACM
Structured data including sets, sequences, trees and graphs, pose significant challenges to fundamental aspects of data management such as efficient storage, indexing, and simila...