Sciweavers

368 search results - page 26 / 74
» Higher Eigenvalues of Graphs
Sort
View
CVPR
2010
IEEE
14 years 1 months ago
One-Shot Multi-Set Non-rigid Feature-Spatial Matching
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...
Marwan Torki and Ahmed Elgammal
CDC
2010
IEEE
142views Control Systems» more  CDC 2010»
13 years 2 months ago
Consensus with constrained convergence rate: Agreement in communities
The study focuses on a class of discrete-time multi-agent systems modelling opinion dynamics with decaying confidence. Essentially, we propose an agreement protocol that impose a p...
Constantin-Irinel Morarescu, Antoine Girard
NIPS
2004
13 years 9 months ago
Hierarchical Eigensolver for Transition Matrices in Spectral Methods
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...
Chakra Chennubhotla, Allan D. Jepson
ECAI
2008
Springer
13 years 9 months ago
Modeling Collaborative Similarity with the Signed Resistance Distance Kernel
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...
Jérôme Kunegis, Stephan Schmidt, Sahi...
STOC
2010
ACM
269views Algorithms» more  STOC 2010»
13 years 11 months ago
Approximations for the Isoperimetric and Spectral Profile of Graphs and Related Parameters
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...
Prasad Raghavendra, David Steurer and Prasad Tetal...