Sciweavers

2607 search results - page 147 / 522
» Complete Functional Synthesis
Sort
View
JFP
2000
163views more  JFP 2000»
15 years 3 months ago
Automatic useless-code elimination for HOT functional programs
In this paper we present two type inference systems for detecting useless-code in higher-order typed functional programs. Type inference can be performed in an efficient and compl...
Ferruccio Damiani, Paola Giannini

Book
376views
17 years 1 months ago
An Exploration of Random Processes for Engineers
"From an applications viewpoint, the main reason to study the subject of these notes is to help deal with the complexity of describing random, time-varying functions. A random...
Bruce Hajek
PAMI
2008
173views more  PAMI 2008»
15 years 3 months ago
Bayes Classification of Online Arabic Characters by Gibbs Modeling of Class Conditional Densities
This study investigates Bayes classification of online Arabic characters using histograms of tangent differences and Gibbs modeling of the class-conditional probability density fun...
Neila Mezghani, Amar Mitiche, Mohamed Cheriet
DAC
2009
ACM
16 years 4 months ago
Timing-driven optimization using lookahead logic circuits
This paper describes a function-based timing-driven optimization technique for the synthesis of multi-level logic circuits. Motivated by the principles of parallel prefix computat...
Mihir R. Choudhury, Kartik Mohanram
ICCD
2002
IEEE
101views Hardware» more  ICCD 2002»
16 years 22 days ago
Improving the Efficiency of Circuit-to-BDD Conversion by Gate and Input Ordering
Boolean functions are fundamental to synthesis and verification of digital logic, and compact representations of Boolean functions have great practical significance. Popular repre...
Fadi A. Aloul, Igor L. Markov, Karem A. Sakallah