712 search results - page 39 / 143 » On Spectral Graph Drawing |
ICPR
2008
IEEE
14 years 10 months ago
2008
IEEE
In this paper we present a method for impulse noise removal that makes use of spectral clustering and graph regularization. The image is modeled as a graph and local spectral anal...
GD
2003
Springer
14 years 2 months ago
2003
Springer
Given two different drawings of a planar graph we consider the problem of morphing one drawing into the other. We designed and implemented an algorithm for intersection-free morph...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
In recent years, spectral clustering has become one of the most popular modern clustering algorithms. It is simple to implement, can be solved efficiently by standard linear algeb...
IM
2007
13 years 8 months ago
2007
We examine the relationship of a graph G and its random subgraphs which are defined by independently choosing each edge with probability p. Suppose that G has a spectral gap λ (...
WCRE
2002
IEEE
14 years 1 months ago
2002
IEEE
The application of spectral methods to the software clustering problem has the advantage of producing results that are within a known factor of the optimal solution. Heuristic sea...