Sciweavers

363 search results - page 21 / 73
» Code Generation for Polynomial Multiplication
Sort
View
EUROCRYPT
2000
Springer
13 years 11 months ago
Improved Fast Correlation Attacks Using Parity-Check Equations of Weight 4 and 5
Abstract. This paper describes new techniques for fast correlation attacks, based on Gallager iterative decoding algorithm using parity-check equations of weight greater than 3. Th...
Anne Canteaut, Michaël Trabbia
PLDI
2009
ACM
14 years 8 months ago
Automatic generation of library bindings using static analysis
High-level languages are growing in popularity. However, decades of C software development have produced large libraries of fast, timetested, meritorious code that are impractical...
Tristan Ravitch, Steve Jackson, Eric Aderhold, Ben...
IEEEPACT
2006
IEEE
14 years 1 months ago
Program generation for the all-pairs shortest path problem
A recent trend in computing are domain-specific program generators, designed to alleviate the effort of porting and reoptimizing libraries for fast-changing and increasingly com...
Sung-Chul Han, Franz Franchetti, Markus Püsch...
BMCBI
2008
149views more  BMCBI 2008»
13 years 7 months ago
Clustering of cognate proteins among distinct proteomes derived from multiple links to a single seed sequence
Background: Modern proteomes evolved by modification of pre-existing ones. It is extremely important to comparative biology that related proteins be identified as members of the s...
Adriano Barbosa-Silva, Venkata P. Satagopam, Reinh...
POPL
2007
ACM
14 years 8 months ago
A typed intermediate language for compiling multiple inheritance
Type-preserving compilation can improve software reliability by generating code that can be verified independently of the compiler. Practical type-preserving compilation does not ...
Juan Chen