Sciweavers

828 search results - page 63 / 166
» Simplicial Powers of Graphs
Sort
View
ISLPED
1997
ACM
83views Hardware» more  ISLPED 1997»
15 years 8 months ago
A symbolic algorithm for low-power sequential synthesis
We present an algorithm that restructures the state transition graph STG of a sequential circuit so as to reduce power dissipation. The STG is modi ed without changing the behav...
Balakrishna Kumthekar, In-Ho Moon, Fabio Somenzi
SAC
2006
ACM
15 years 10 months ago
Mining and analyzing the topological structure of protein-protein interaction networks
We report a comprehensive evaluation of the topological structure of protein-protein interaction (PPI) networks by mining and analyzing graphs constructed from the publicly availa...
Daniel Duanqing Wu, Xiaohua Hu
DAC
2000
ACM
16 years 5 months ago
The use of carry-save representation in joint module selection and retiming
Joint module selection and retiming is a powerful technique to optimize the implementation cost and the speed of a circuit specified using a synchronous data-flow graph (DFG). In ...
Zhan Yu, Kei-Yong Khoo, Alan N. Willson Jr.
VL
2005
IEEE
104views Visual Languages» more  VL 2005»
15 years 9 months ago
Using a Molecular Metaphor to Facilitate Comprehension of 3D Object Diagrams
This paper presents a strategy for the visualization of dynamic object relationships in Java programs. The metaphor of a chemical molecule is used to aid comprehension, and to hel...
Brian A. Malloy, James F. Power
ASYNC
1997
IEEE
95views Hardware» more  ASYNC 1997»
15 years 8 months ago
Partial order based approach to synthesis of speed-independent circuits
This paper introduces a novel technique for synthesis of speed-independent circuits from their Signal Transition Graph specifications. The new method uses partial order in the fo...
Alexei L. Semenov, Alexandre Yakovlev, Enric Pasto...