Sciweavers

805 search results - page 29 / 161
» Semantics-based code search
Sort
View
BMCBI
2011
13 years 4 months ago
Simulated evolution applied to study the genetic code optimality using a model of codon reassignments
Background: As the canonical code is not universal, different theories about its origin and organization have appeared. The optimization or level of adaptation of the canonical ge...
Jose Santos, Ángel Monteagudo
IPM
2011
71views more  IPM 2011»
13 years 1 months ago
Improving semistatic compression via phrase-based modeling
In recent years, new semistatic word-based byte-oriented text compressors, such as Tagged Huffman and those based on Dense Codes, have shown that it is possible to perform fast d...
Nieves R. Brisaboa, Antonio Fariña, Gonzalo...
CORR
2006
Springer
163views Education» more  CORR 2006»
13 years 9 months ago
Finding roots of polynomials over finite fields
In this paper we propose an improved algorithm for finding roots of polynomials over finite fields. This makes possible significant speed up of the decoding process of BCH, Reed-S...
Sergei V. Fedorenko, Peter Vladimirovich Trifonov
IPPS
2009
IEEE
14 years 4 months ago
A scalable auto-tuning framework for compiler optimization
We describe a scalable and general-purpose framework for auto-tuning compiler-generated code. We combine Active Harmony’s parallel search backend with the CHiLL compiler transfo...
Ananta Tiwari, Chun Chen, Jacqueline Chame, Mary W...
ICCS
2009
Springer
14 years 4 months ago
Generating Empirically Optimized Composed Matrix Kernels from MATLAB Prototypes
The development of optimized codes is time-consuming and requires extensive architecture, compiler, and language expertise, therefore, computational scientists are often forced to ...
Boyana Norris, Albert Hartono, Elizabeth R. Jessup...