Sciweavers

34 search results - page 1 / 7
» Error analysis of spectral method on a triangle
Sort
View
ADCM
2007
66views more  ADCM 2007»
13 years 5 months ago
Error analysis of spectral method on a triangle
Ben-yu Guo, Li-lian Wang
CORR
2010
Springer
110views Education» more  CORR 2010»
13 years 5 months ago
Detecting communities of triangles in complex networks using spectral optimization
The study of the sub-structure of complex networks is of major importance to relate topology and functionality. Many efforts have been devoted to the analysis of the modular struc...
Belkacem Serrour, Alex Arenas, Sergio Gómez
NA
2010
96views more  NA 2010»
13 years 3 months ago
Spectral element methods on unstructured meshes: which interpolation points?
In the field of spectral element approximations, the interpolation points can be chosen on the basis of different criteria, going from the minimization of the Lebesgue constant to ...
Richard Pasquetti, Francesca Rapetti
KAIS
2011
129views more  KAIS 2011»
13 years 4 days ago
Counting triangles in real-world networks using projections
Triangle counting is an important problem in graph mining. Two frequently used metrics in complex network analysis which require the count of triangles are the clustering coefficie...
Charalampos E. Tsourakakis
COMGEO
1999
ACM
13 years 4 months ago
Optimal triangulation and quadric-based surface simplification
Many algorithms for reducing the number of triangles in a surface model have been proposed, but to date there has been little theoretical analysis of the approximations they produ...
Paul S. Heckbert, Michael Garland