Sciweavers

5606 search results - page 423 / 1122
» Randomization Techniques for Graphs.
Sort
View
TCAD
1998
82views more  TCAD 1998»
15 years 6 months ago
Structural methods for the synthesis of speed-independent circuits
Most existing tools for the synthesisof asynchronouscircuits from Signal Transition Graphs (STGs) derive the reachability graph for the calculation of logic equations. This paper ...
Enric Pastor, Jordi Cortadella, Alex Kondratyev, O...
FAC
2010
148views more  FAC 2010»
15 years 5 months ago
Automating the transformation-based analysis of visual languages
We present a novel approach for the automatic generation of model-to-model transformations given a description of the operational semantics of the source language in the form of gr...
Juan de Lara, Hans Vangheluwe
ICASSP
2011
IEEE
14 years 10 months ago
Multi-graph regularization for efficient delivery of user generated content in online social networks
We present a methodology for enhancing the delivery of usergenerated content in online social networks. To this end, we first regularize the social graph via node capacity and li...
Jacob Chakareski
AOSD
2006
ACM
16 years 21 days ago
Towards supporting on-demand virtual remodularization using program graphs
OOP style requires programmers to organize their code according to objects (or nouns, using natural language as a metaphor), causing a program’s actions (verbs) to become scatte...
David Shepherd, Lori L. Pollock, K. Vijay-Shanker
LCTRTS
2004
Springer
16 years 2 days ago
Generating fast code from concurrent program dependence graphs
While concurrency in embedded systems is most often supplied by real-time operating systems, this approach can be unpredictable and difficult to debug. Synchronous concurrency, i...
Jia Zeng, Cristian Soviani, Stephen A. Edwards