Sciweavers

6592 search results - page 109 / 1319
» On robust cycle bases
Sort
View
IUI
1993
ACM
15 years 10 months ago
Knowledgeable development environments using shared design models
We describe MASTERMIND, a step toward our vision of a knowledge-based design-time and run-time environment where human-computer interfaces development is centered around an all-en...
Robert Neches, James D. Foley, Pedro A. Szekely, P...
ISCAPDCS
2001
15 years 7 months ago
Performance Evaluation of a Non-Blocking Multithreaded Architecture for Embedded, Real-Time and DSP Applications
This paper presents the evaluation of a non-blocking, decoupled memory/execution, multithreaded architecture known as the Scheduled Dataflow (SDF). The major recent trend in digit...
Krishna M. Kavi, Joseph Arul, Roberto Giorgi
GC
2008
Springer
15 years 6 months ago
A Bijection for Eulerian-equivalence Classes of Totally Cyclic Orientations
Gioan showed that the number of cycle reversing classes of totally cyclic orientations of a given graph can be calculated as an evaluation of the corresponding Tutte polynomial. We...
Beifang Chen, Arthur L. B. Yang, Terence Y. J. Zha...
JSC
2006
64views more  JSC 2006»
15 years 6 months ago
Computing the support of local cohomology modules
For a polynomial ring R = k[x1, ..., xn], we present a method to compute the characteristic cycle of the localization Rf for any nonzero polynomial f R that avoids a direct comput...
Josep Àlvarez Montaner, Anton Leykin
ASPDAC
2010
ACM
135views Hardware» more  ASPDAC 2010»
15 years 4 months ago
Statistical timing verification for transparently latched circuits through structural graph traversal
Level-sensitive transparent latches are widely used in high-performance sequential circuit designs. Under process variations, the timing of a transparently latched circuit will ada...
Xingliang Yuan, Jia Wang