Buscar
Mostrando ítems 1-10 de 92
Improved analysis of a max-cut algorithm based on spectral partitioning
(SIAM, 2015)
Trevisan [SIAM J. Comput., 41 (2012), pp. 1769-1786] presented an algorithm for Max-Cut based on spectral partitioning techniques. This is the first algorithm for Max-Cut with an approximation guarantee strictly larger ...
Spectral Graph Analysis for Process Monitoring
(American Chemical Society, 2014-05)
Process monitoring is a fundamental task to support operator decisions under ab- normal situations. Most process monitoring approaches, such as Principal Components Analysis and Locality Preserving Projections, are based ...
On The Critical Point Structure of Eigenfunctions Belonging to the First Nonzero Eigenvalue of a Genus Two Closed Hyperbolic Surface
(Science Journal Publication, 2012-05-01)
We develop a method based on spectral graph theory to approximate the eigenvalues and eigenfunctions of the Laplace-Beltrami operator of a compact riemannian manifold. The method is applied to a closed hyperbolic surface ...
Agrupamento de sequências de miRNA utilizando aprendizado não-supervisionado baseado em grafos
(Universidade Federal de São CarlosUFSCarPrograma de Pós-Graduação em Ciência da Computação - PPGCCCâmpus São Carlos, 2016-08-12)
Cluster analysis is the organization of a collection of patterns into clusters based on similarity
which is determined by using properties of data. Clustering techniques can be useful in a
variety of knowledge domains ...
Um algoritmo eficiente para estimar os momentos espectrais de grafos grandes não dirigidos com pesos
(Universidade Tecnológica Federal do ParanáCornelio ProcopioBrasilPrograma de Pós-Graduação em InformáticaUTFPR, 2020-08-13)
A graph is a collection of vertexes and edges, each one connecting two vertexes. We can use the spectral moments to characterize the topology of the graph. The algorithms that calculate the spectral moments have a cubic-order ...
Evaluating links through spectral decomposition
(IOP PUBLISHING LTDBRISTOL, 2012)
Spectral decomposition has rarely been used to investigate complex networks. In this work we apply this concept in order to define two kinds of link-directed attacks while quantifying their respective effects on the topology. ...
Métodos espectrais de partição de grafos
(Universidade Tecnológica Federal do ParanáCuritibaBrasilLicenciatura em MatemáticaUTFPR, 2018-12-11)
The Theory of Graphs has great potential for the description and mathematical modeling of phenomena associated to networks. In problems of this nature a recurring difficulty is the size of the network, i.e. the number of ...