Sciweavers

1294 search results - page 146 / 259
» FFT Compiler Techniques
Sort
View
JAR
2008
89views more  JAR 2008»
13 years 9 months ago
An Extensible Encoding of Object-oriented Data Models in hol
Abstract We present an extensible encoding of object-oriented data models into higherorder logic (HOL). Our encoding is supported by a datatype package that leverages the use of th...
Achim D. Brucker, Burkhart Wolff
TSMC
2008
105views more  TSMC 2008»
13 years 8 months ago
Gene Identification: Classical and Computational Intelligence Approaches
: Automatic identification of genes has been an actively researched area of Bioinformatics. Compared to earlier attempts for finding genes, the recent techniques are significantly ...
Sanghamitra Bandyopadhyay, Ujjwal Maulik, D. Roy
CSL
2004
Springer
13 years 8 months ago
Arc minimization in finite-state decoding graphs with cross-word acoustic context
Recent approaches to large vocabulary decoding with finite state graphs have focused on the use of state minimization algorithms to produce relatively compact graphs. This paper e...
François Yvon, Geoffrey Zweig, George Saon
CC
2002
Springer
131views System Software» more  CC 2002»
13 years 8 months ago
Global Variable Promotion: Using Registers to Reduce Cache Power Dissipation
Global variable promotion, i.e. allocating unaliased globals to registers, can significantly reduce the number of memory operations. This results in reduced cache activity and less...
Andrea G. M. Cilio, Henk Corporaal
CORR
2000
Springer
110views Education» more  CORR 2000»
13 years 8 months ago
Finite-State Non-Concatenative Morphotactics
Finite-state morphology in the general tradition of the Two-Level and Xerox implementations has proved very successful in the production of robust morphological analyzer-generator...
Kenneth R. Beesley, Lauri Karttunen