## Abstract Various methods of generating dataflow diagrams use an algebraic transformation system for a given inputβoutput relationship. These methods require mutual transformations between the inputβoutput relationship and algebraic expressions, and also a consistency check between the generated
β¦ LIBER β¦
An efficient general iterative algorithm for dataflow analysis
β Scribed by Susan Horwitz; Alan Demers; Tim Teitelbaum
- Publisher
- Springer-Verlag
- Year
- 1987
- Tongue
- English
- Weight
- 772 KB
- Volume
- 24
- Category
- Article
- ISSN
- 0001-5903
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
An algorithm for generating dataflow dia
β
Shuichiro Yamamoto; Kenji Ohta
π
Article
π
1994
π
John Wiley and Sons
π
English
β 877 KB
An iterative algorithm for analysis of v
β
J.J. Daudin
π
Article
π
1979
π
Elsevier Science
π
English
β 659 KB
An iteration algorithm for kinematic sha
β
Yuan-Gao Zhang
π
Article
π
1995
π
Elsevier Science
π
English
β 739 KB
An iterative algorithm for generalized n
β
R. Ahmad; Q.H. Ansari
π
Article
π
2000
π
Elsevier Science
π
English
β 195 KB
An efficient algorithm for generalized d
An efficient algorithm for generalized discriminant analysis using incomplete Cholesky decomposition
β
Haixian Wang; Zilan Hu; Yuβe Zhao
π
Article
π
2007
π
Elsevier Science
π
English
β 626 KB
Generalized discriminant analysis (GDA) has provided an extremely powerful approach to extracting nonlinear features via kernel trick. And it has been suggested for a number of applications, such as classification problem. Whereas the GDA could be solved by the utilization of Mercer kernels, a drawb
An iterative algorithm for connected str
β
S.S. Samus; P.W. McOwan; W.J. Hossack
π
Article
π
1994
π
Elsevier Science
π
English
β 271 KB