Sciweavers

903 search results - page 119 / 181
» On the reduction of a random basis
Sort
View
ISPD
1997
ACM
104views Hardware» more  ISPD 1997»
15 years 10 months ago
Timing driven placement in interaction with netlist transformations
In this paper, we present a new approach that performs timing driven placement for standard cell circuits in interaction with netlist transformations. As netlist transformations a...
Guenter Stenz, Bernhard M. Riess, Bernhard Rohflei...
WADT
1997
Springer
15 years 10 months ago
An inductive view of graph transformation
The dynamic behavior of rule-based systems (like term rewriting systems 24], process algebras 27], and so on) can be traditionally determined in two orthogonal ways. Either operati...
Fabio Gadducci, Reiko Heckel
ASPDAC
1998
ACM
72views Hardware» more  ASPDAC 1998»
15 years 10 months ago
Space- and Time-Efficient BDD Construction via Working Set Control
Binary decision diagrams (BDDs) have been shown to be a powerful tool in formal verification. Efficient BDD construction techniques become more important as the complexity of proto...
Bwolen Yang, Yirng-An Chen, Randal E. Bryant, Davi...
VISSYM
2007
15 years 8 months ago
Subdivision Volume Splatting
Volumetric Subdivision (VS) is a powerful paradigm that enables volumetric sculpting and realistic volume deformations that give rise to the concept of "virtual clay". I...
Kevin T. McDonnell, Neophytos Neophytou, Klaus Mue...
AAAI
2008
15 years 8 months ago
Sparse Projections over Graph
Recent study has shown that canonical algorithms such as Principal Component Analysis (PCA) and Linear Discriminant Analysis (LDA) can be obtained from graph based dimensionality ...
Deng Cai, Xiaofei He, Jiawei Han