Fig 1 - uploaded by Francesc Serratosa
Content may be subject to copyright.
Source publication
This paper presents a new parallel algorithm to compute the graph-matching based on the Graduated Assignment. The aim of this paper is to perform graph matching in a current desktop computer, but, instead of executing the code in the generic processor, we execute a parallel code in the graphic processor unit. This computer can be embedded in a low-...
Similar publications
We study the equilibrium or KMS states of the Toeplitz C*-algebra of a finite higher-rank graph which is reducible. The Toeplitz algebra carries a gauge action of a higher-dimensional torus, and a dynamics arises by choosing an embedding of the real numbers in the torus. Here we use an embedding which leads to a dynamics which has previously been i...
In this article, Homotopy analysis method is successfully used to find the approximate solution of fractional order Van der Pol equation. The fractional derivative is described in the Caputo sense.The numerical computations of convergence control parameters for the acceleration of convergence of approximate series solution are obtained by the analy...
We present new numerical characterization of DNA sequences that is based on the modified graphical representation proposed by Hamori. While Hamori embeds the sequence into Euclidean space, we use analogous embedding into the strong product of graphs, K4 ??? Pn, with weighted edges. Based on this representation, a novel numerical characterization wa...
Acknowledgements: We thank our external collaborators and members of the Network Dynamics and Simulation Science Laboratory(NDSSL) for their suggestions and comments. Abstract—It is now well established that social contact net-works play a critical role in the progression of epidemics in urban regions. This paper analyzes the graphical and relation...