Buscar
Mostrando ítems 1-10 de 194
A graph-based framework for thermal faceprint characterization
(2011-09-26)
Thermal faceprint has been paramount in the last years. Since we can handle with face recognition using images acquired in the infrared spectrum, an unique individual's signature can be obtained through the blood vessels ...
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 ...
A graph-based framework for thermal faceprint characterization
(2011-09-26)
Thermal faceprint has been paramount in the last years. Since we can handle with face recognition using images acquired in the infrared spectrum, an unique individual's signature can be obtained through the blood vessels ...
On the laplacian and signless laplacian spectrum of a graph with k pairwise co-neighbor vertices
(ELSEVIER SCIENCE INC, 2012)
Transfer matrices for discrete Hermitian operators and absolutely continuous spectrum
(Academic Press Inc., 2021)
© 2021 Elsevier Inc.We introduce a transfer matrix method for the spectral analysis of discrete Hermitian operators with locally finite hopping. Such operators can be associated with a locally finite graph structure and ...
Discriminating Different Classes of Biological Networks by Analyzing the Graphs Spectra Distribution
(PUBLIC LIBRARY SCIENCESAN FRANCISCO, 2012)
The brain's structural and functional systems, protein-protein interaction, and gene networks are examples of biological systems that share some features of complex networks, such as highly connected nodes, modularity, and ...
Teoria Espectral de Grafos aplicada ao problema de Isomorfismo de Grafos
(Universidade Federal do Espírito SantoBRCiência da ComputaçãoPrograma de Pós-Graduação em InformáticaUFES, 2010-08-23)
In this work we investigated the use of concepts from Spectral Graph Theory (SGT) to support the construction of algorithms that solve the Graph Isomorphism Problem (GIP). Three theoretical results which consider information ...
A lower bound for the energy of symmetric matrices and graphs
(2017)
The energy of a symmetric matrix is the sum of the absolute values of its eigenvalues. We introduce a lower bound for the energy of a symmetric matrix partitioned into blocks. This bound is related to the spectrum of its ...