99 search results - page 4 / 20 » An Analysis of the Convergence of Graph Laplacians |
JSCIC
2007
13 years 5 months ago
2007
In this paper, we examine some computational issues on finite element discretization of the p-Laplacian. We introduced a class of descent methods with multi-grid finite element ...
INFORMATICALT
2007
13 years 5 months ago
2007
Abstract. In this paper an exact and complete analysis of the Lloyd–Max’s algorithm and its initialization is carried out. An effective method for initialization of Lloyd–Max...
SDM
2010
SIAM
13 years 7 months ago
2010
SIAM
We study the application of spectral clustering, prediction and visualization methods to graphs with negatively weighted edges. We show that several characteristic matrices of gra...
CORR
2011
Springer
13 years 23 days ago
2011
Springer
Abstract. Consider a weighted and undirected graph, possibly with self-loops, and its corresponding Laplacian matrix, possibly augmented with additional diagonal elements correspon...
SMI
2006
IEEE
13 years 11 months ago
2006
IEEE
Sparse Low-degree IMplicit (SLIM) surface [11] is a recently developed non-conforming surface representation. In this paper, a method for free-form deformation of SLIM surfaces is...