Sciweavers

1133 search results - page 143 / 227
» Basics of Graph Cuts
Sort
View
IEEEPACT
1998
IEEE
15 years 2 months ago
Athapascan-1: On-Line Building Data Flow Graph in a Parallel Language
In order to achieve practical efficient execution on a parallel architecture, a knowledge of the data dependencies related to the application appears as the key point for building...
François Galilée, Jean-Louis Roch, G...
ICALP
2000
Springer
15 years 1 months ago
On Message Sequence Graphs and Finitely Generated Regular MSC Languages
Message Sequence Charts (MSCs) are an attractive visual formalism widely used to capture system requirements during the early design stages in domains such as telecommunication sof...
Jesper G. Henriksen, Madhavan Mukund, K. Narayan K...
IANDC
2007
111views more  IANDC 2007»
14 years 9 months ago
Expressiveness and complexity of graph logic
We investigate the complexity and expressive power of a spatial logic for reasoning about graphs. This logic was previously introduced by Cardelli, Gardner and Ghelli, and provide...
Anuj Dawar, Philippa Gardner, Giorgio Ghelli
JGAA
2007
87views more  JGAA 2007»
14 years 9 months ago
A 2.5D Hierarchical Drawing of Directed Graphs
We introduce a new graph drawing convention for 2.5D hierarchical drawings of directed graphs. The vertex set is partitioned both into layers of vertices drawn in parallel planes ...
Seok-Hee Hong, Nikola S. Nikolov, Alexandre Tarass...
MSCS
2007
91views more  MSCS 2007»
14 years 9 months ago
A rewriting calculus for cyclic higher-order term graphs
Introduced at the end of the nineties, the Rewriting Calculus (ρ-calculus, for short) is a simple calculus that fully integrates term-rewriting and λ-calculus. The rewrite rules...
Paolo Baldan, Clara Bertolissi, Horatiu Cirstea, C...