Sciweavers

363 search results - page 17 / 73
» Code Generation for Polynomial Multiplication
Sort
View
ICSEA
2008
IEEE
14 years 2 months ago
Reuse through Requirements Traceability
The Reuse of code artefacts can make development quicker, cheaper and more robust, but the process is complex and has many pitfalls: Code artefacts must exist, be available, be fo...
Rob Pooley, Craig Warren
ICMCS
2006
IEEE
134views Multimedia» more  ICMCS 2006»
14 years 1 months ago
Robust Video Transmission Over MIMO-OFDM System using MDC and Space Time Codes
MIMO-OFDM is a promising technique for the broadband wireless communication system. In this paper, we propose a novel scheme that integrates multiple description coding (MDC), err...
Haifeng Zheng, Congchong Ru, Lun Yu, Chang Chen
JCT
2010
92views more  JCT 2010»
13 years 6 months ago
Enumeration by kernel positions for strongly Bernoulli type truncation games on words
We find the winning strategy for a class of truncation games played on words. As a consequence of the present author’s recent results on some of these games we obtain new formul...
Gábor Hetyei
ICCAD
1998
IEEE
95views Hardware» more  ICCAD 1998»
13 years 12 months ago
Control generation for embedded systems based on composition of modal processes
In traditional distributed embedded system designs, control information is often replicated across several processes and kept coherent by application-specific mechanisms. Conseque...
Pai H. Chou, Ken Hines, Kurt Partridge, Gaetano Bo...
ICPP
1991
IEEE
13 years 11 months ago
Automatic Parallel Program Generation and Optimization from Data Decompositions
Data decomposition is probably the most successful method for generating parallel programs. In this paper a general framework is described for the automatic generation of parallel...
Edwin M. R. M. Paalvast, Henk J. Sips, Arjan J. C....