712 search results - page 74 / 143 » On Spectral Graph Drawing |
HCI
2009
13 years 6 months ago
2009
Circular anchored maps have been proposed as a drawing technique to acquire knowledge from bipartite graphs, where nodes in one set are arranged on a circumference. However, the re...
KDD
2004
ACM
14 years 9 months ago
2004
ACM
Kernel k-means and spectral clustering have both been used to identify clusters that are non-linearly separable in input space. Despite significant research, these methods have re...
CAD
2007
Springer
13 years 8 months ago
2007
Springer
We present an approach for robust shape retrieval from databases containing articulated 3D models. Each shape is represented by the eigenvectors of an appropriately defined affin...
ICIP
2007
IEEE
14 years 10 months ago
2007
IEEE
A representation for observing local image content is proposed for the purpose of considering the distinguishing characteristics of visual content that tends to draw a human obser...
ICCV
2005
IEEE
14 years 10 months ago
2005
IEEE
We present an efficient spectral method for finding consistent correspondences between two sets of features. We build the adjacency matrix M of a graph whose nodes represent the p...