Sciweavers

182 search results - page 12 / 37
» Ludo: A Case Study for Graph Transformation Tools
Sort
View
DELTA
2004
IEEE
13 years 11 months ago
Arithmetic Transformations to Maximise the Use of Compressor Trees
Complex arithmetic computations, especially if derived from bit-level software descriptions, can be very inefficient if implemented directly in hardware (e.g., by translation of t...
Paolo Ienne, Ajay K. Verma
RSP
2005
IEEE
14 years 1 months ago
Porting DSP Applications across Design Tools Using the Dataflow Interchange Format
Modeling DSP applications through coarse-grain dataflow graphs is popular in the DSP design community, and a growing set of rapid prototyping tools support such dataflow semantics...
Chia-Jui Hsu, Shuvra S. Bhattacharyya
SBMF
2010
Springer
132views Formal Methods» more  SBMF 2010»
13 years 2 months ago
Midlet Navigation Graphs in JML
Abstract. In the context of the EU project Mobius on Proof Carrying Code for Java programs (midlets) on mobile devices, we present a way to express midlet navigation graphs in JML....
Wojciech Mostowski, Erik Poll
AEI
2008
108views more  AEI 2008»
13 years 7 months ago
Combinatorial synthesis approach employing graph networks
The paper proposes a methodology to assist the designer at the initial stages of the design synthesis process by enabling him/her to employ knowledge and algorithms existing in gr...
Offer Shai, Noel Titus, Karthik Ramani
IPMU
2010
Springer
13 years 9 months ago
The Link Prediction Problem in Bipartite Networks
We define and study the link prediction problem in bipartite networks, specializing general link prediction algorithms to the bipartite case. In a graph, a link prediction functio...
Jérôme Kunegis, Ernesto William De Lu...