8 search results - page 2 / 2 » Eigenspaces for Graphs |
CVPR
2008
IEEE
14 years 8 months ago
2008
IEEE
Matching articulated shapes represented by voxel-sets reduces to maximal sub-graph isomorphism when each set is described by a weighted graph. Spectral graph theory can be used to...
KDD
2010
ACM
13 years 9 months ago
2010
ACM
Constrained clustering has been well-studied for algorithms like K-means and hierarchical agglomerative clustering. However, how to encode constraints into spectral clustering rem...
SIGGRAPH
2009
ACM
14 years 17 days ago
2009
ACM
Spectral methods for mesh processing and analysis rely on the eigenvalues, eigenvectors, or eigenspace projections derived from appropriately defined mesh operators to carry out ...