Sciweavers

1357 search results - page 96 / 272
» Compositionality in Graph Transformation
Sort
View
ICCAD
2005
IEEE
127views Hardware» more  ICCAD 2005»
16 years 10 days ago
Hardware synthesis from guarded atomic actions with performance specifications
We present a new hardware synthesis methodology for guarded atomic actions (or rules), which satisfies performance-related scheduling specifications provided by the designer. The ...
Daniel L. Rosenband
123
Voted
VL
2007
IEEE
104views Visual Languages» more  VL 2007»
15 years 9 months ago
A Peirce Style Calculus for ALC
Description logics (DLs) are a well-understood family of knowledge representation (KR) languages. The notation of DLs has the flavour of a variable-free first order predicate lo...
Frithjof Dau, Peter W. Eklund
142
Voted
GBRPR
2007
Springer
15 years 7 months ago
Constellations and the Unsupervised Learning of Graphs
Abstract. In this paper, we propose a novel method for the unsupervised clustering of graphs in the context of the constellation approach to object recognition. Such method is an E...
Boyan Bonev, Francisco Escolano, Miguel Angel Loza...
CGVR
2008
15 years 4 months ago
A Graph Drawing Algorithm for the Game of Sprouts
- A graph drawing algorithm for the Game of Sprouts is presented. The algorithm guarantees that the polylines that connect graph nodes are drawn smoothly and that they maintain rea...
Wayne Brown, Leemon C. Baird III
ECEASST
2010
15 years 25 days ago
Graph Algebras for Bigraphs
In this talk we will present a new approach to deal with attributed graphs and attributed graph transformation. The approach is based on working with what we call symbolic graphs, ...
Davide Grohmann, Marino Miculan