Sciweavers

144 search results - page 11 / 29
» Throughput Analysis of Synchronous Data Flow Graphs
Sort
View
ICCAD
2000
IEEE
149views Hardware» more  ICCAD 2000»
14 years 2 days ago
Dynamic Response Time Optimization for SDF Graphs
Synchronous Data Flow (SDF) is a well-known model of computation that is widely used in the control engineering and digital signal processing domains. Existing scheduling methods ...
Dirk Ziegenbein, Jan Uerpmann, Ralph Ernst
CSB
2004
IEEE
177views Bioinformatics» more  CSB 2004»
13 years 11 months ago
High-Throughput 3D Structural Homology Detection via NMR Resonance Assignment
One goal of the structural genomics initiative is the identification of new protein folds. Sequence-based structural homology prediction methods are an important means for priorit...
Christopher James Langmead, Bruce Randall Donald
DAGSTUHL
1996
13 years 9 months ago
Specialization of Imperative Programs Through Analysis of Relational Expressions
An analysis method for specialization of imperative programs is described in this paper. This analysis is an inter-procedural data flow method operating on control flow graphs and...
Alexander Sakharov
ICPP
1998
IEEE
13 years 12 months ago
Concurrent SSA Form in the Presence of Mutual Exclusion
Most current compiler analysis techniques are unable to cope with the semantics introduced by explicit parallel and synchronization constructs in parallel programs. In this paper ...
Diego Novillo, Ronald C. Unrau, Jonathan Schaeffer
RSFDGRC
2005
Springer
134views Data Mining» more  RSFDGRC 2005»
14 years 1 months ago
The Computational Complexity of Inference Using Rough Set Flow Graphs
Pawlak recently introduced rough set flow graphs (RSFGs) as a graphical framework for reasoning from data. Each rule is associated with three coefficients, which have been shown t...
Cory J. Butz, Wen Yan, Boting Yang