1538 search results - page 4 / 308 » Spectral Techniques in Graph Algorithms |
GD
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. We present a fast spectral graph drawing algorithm for drawing undirected connected graphs. Classical Multi-Dimensional Scaling yields a quadratictime spectral algorithm,...
146
click to vote
CVPR
2010
IEEE
15 years 8 months ago
2010
IEEE
This paper studies the problem of learning a full range of pairwise affinities gained by integrating local grouping cues for spectral segmentation. The overall quality of the spect...
ECCC
2006
14 years 11 months ago
2006
IPPS
1999
IEEE
15 years 3 months ago
1999
IEEE
In this paper we present new algorithms for spectral graph partitioning. Previously, the best partitioning methods were based on a combination of Combinatorial algorithms and appli...
157
click to vote
CVPR
2009
IEEE
16 years 6 months ago
2009
IEEE
This paper addresses the problem of establishing correspondences
between two sets of visual features using
higher-order constraints instead of the unary or pairwise
ones used in...