107 search results - page 19 / 22 » Eigenvalues of the derangement graph |
CVPR
2010
IEEE
14 years 26 days ago
2010
IEEE
We introduce a novel framework for nonrigid feature
matching among multiple sets in a way that takes into consideration
both the feature descriptor and the features spatial
arra...
NIPS
2004
13 years 8 months ago
2004
We show how to build hierarchical, reduced-rank representation for large stochastic matrices and use this representation to design an efficient algorithm for computing the largest...
ECAI
2008
Springer
13 years 8 months ago
2008
Springer
We extend the resistance distance kernel to the domain of signed dissimilarity values, and show how it can be applied to collaborative rating prediction. The resistance distance is...
STOC
2010
ACM
13 years 10 months ago
2010
ACM
The spectral profile of a graph is a natural generalization of the classical notion of its Rayleigh quotient. Roughly speaking, given a graph G, for each 0 < < 1, the spect...
JMLR
2010
13 years 5 months ago
2010
How can we generate realistic networks? In addition, how can we do so with a mathematically tractable model that allows for rigorous analysis of network properties? Real networks ...