1538 search results - page 3 / 308 » Spectral Techniques in Graph Algorithms |
COCO
2010
Springer
13 years 11 months ago
2010
Springer
We present a new algorithm for Unique Games which is based on purely spectral techniques, in contrast to previous work in the area, which relies heavily on semidefinite programmi...
MICCAI
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Image segmentation algorithms derived from spectral clustering analysis rely on the eigenvectors of the Laplacian of a weighted graph obtained from the image. The NCut cr...
STOC
2010
ACM
13 years 11 months ago
2010
ACM
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...
JMLR
2011
13 years 2 months ago
2011
Following Hartigan (1975), a cluster is defined as a connected component of the t-level set of the underlying density, that is, the set of points for which the density is greater...
MVA
2007
13 years 9 months ago
2007
In this paper we propose an image segmentation algorithm that combines region merging with spectral-based techniques. An initial partitioning of the image into primitive regions i...