Sciweavers

327 search results - page 26 / 66
» A Theory of Information-Flow Labels
Sort
View
IANDC
2006
97views more  IANDC 2006»
14 years 9 months ago
Pure bigraphs: Structure and dynamics
Abstract Bigraphs are graphs whose nodes may be nested, representing locality, independently of the edges connecting them. They may be equipped with reaction rules, forming a bigra...
Robin Milner
FOSSACS
2004
Springer
15 years 3 months ago
Deriving Bisimulation Congruences in the DPO Approach to Graph Rewriting
Abstract. Motivated by recent work on the derivation of labelled transitions and bisimulation congruences from unlabelled reaction rules, we show how to solve this problem in the D...
Hartmut Ehrig, Barbara König
JLP
2007
130views more  JLP 2007»
14 years 9 months ago
A compositional coalgebraic model of fusion calculus
This paper is a further step in exploring the labelled transitions and bisimulations of fusion calculi. We follow a recent theory by the same authors and previously applied to the...
Maria Grazia Buscemi, Ugo Montanari
PAMI
2006
440views more  PAMI 2006»
14 years 9 months ago
Random Walks for Image Segmentation
Abstract-- A novel method is proposed for performing multilabel, interactive image segmentation. Given a small number of pixels with user-defined (or pre-defined) labels, one can a...
Leo Grady
LICS
2008
IEEE
15 years 4 months ago
Typed Normal Form Bisimulation for Parametric Polymorphism
This paper presents a new bisimulation theory for parametric polymorphism which enables straightforward coinductive proofs of program equivalences involving existential types. The...
Søren B. Lassen, Paul Blain Levy