712 search results - page 67 / 143 » On Spectral Graph Drawing |
124
click to vote
KDD
2005
ACM
16 years 2 months ago
2005
ACM
Graph clustering (also called graph partitioning) -- clustering the nodes of a graph -- is an important problem in diverse data mining applications. Traditional approaches involve...
113
click to vote
RT
1999
Springer
15 years 6 months ago
1999
Springer
A visibility algorithm for triangulated panoramas is proposed. The algorithm can correctly resolve the visibility without making use of any depth information. It is especially usef...
127
click to vote
JCT
2007
15 years 2 months ago
2007
We prove a number of relations between the number of cliques of a graph G and the largest eigenvalue (G) of its adjacency matrix. In particular, writing ks (G) for the number of s...
133
Voted
ICCV
2003
IEEE
16 years 4 months ago
2003
IEEE
Vision tasks, such as segmentation, grouping, recognition, can be formulated as graph partition problems. The recent literature witnessed two popular graph cut algorithms: the Ncu...
102
click to vote
ICIP
2007
IEEE
15 years 8 months ago
2007
IEEE
This paper develops a classification algorithm in the framework of spectral graph theory where the underlying manifold of a high dimensional data set is described by a graph. The...