Sciweavers

5473 search results - page 51 / 1095
» On the graph isomorphism problem
Sort
View
GG
2008
Springer
15 years 28 days ago
A Decentralized Implementation of Mobile Ambients
We present a graphical implementation for finite processes of the mobile ambients calculus. Our encoding uses unstructured (i.e., non hierarchical) graphs and it is sound and comp...
Fabio Gadducci, Giacoma Valentina Monreale
JSYML
2011
108views more  JSYML 2011»
14 years 6 months ago
Analytic equivalence relations and bi-embeddability
Abstract. Louveau and Rosendal [5] have shown that the relation of biembeddability for countable graphs as well as for many other natural classes of countable structures is complet...
Sy-David Friedman, Luca Motto Ros
FLAIRS
2006
15 years 1 months ago
Inexact Graph Matching: A Case of Study
Inexact graph matching has become an important research area because it is used to find similarities among objects in several real domains such as chemical and biological compound...
Ivan Olmos, Jesus A. Gonzalez, Mauricio Osorio
ECCV
2008
Springer
16 years 1 months ago
Non-local Regularization of Inverse Problems
This article proposes a new framework to regularize linear inverse problems using the total variation on non-local graphs. This nonlocal graph allows to adapt the penalization to t...
Gabriel Peyré, Laurent D. Cohen, Séb...
AUSAI
2004
Springer
15 years 5 months ago
A New Neighborhood Based on Improvement Graph for Robust Graph Coloring Problem
In this paper, we propose a new neighborhood structure based on the improvement graph for solving the Robust Graph Coloring Problem, an interesting extension of classical graph col...
Songshan Guo, Ying Kong, Andrew Lim, Fan Wang