Sciweavers

269 search results - page 1 / 54
» Maximal Static Expansion
Sort
View
POPL
1998
ACM
13 years 9 months ago
Maximal Static Expansion
Memory expansions are classical means to extract parallelism from imperative programs. However, for dynamic control programs with general memory accesses, such transformations eit...
Denis Barthou, Albert Cohen, Jean-Francois Collard
ICC
2007
IEEE
163views Communications» more  ICC 2007»
13 years 11 months ago
Packet Dispatching Algorithms with the Static Connection Patterns Scheme for Three-Stage Buffered Clos-Network Switches
—Rapid expansion of the Internet and increasing demand for multimedia services fosters an immediate need for the development of new high-capacity networks capable of supporting t...
Janusz Kleban, Hugo Santos
ICASSP
2010
IEEE
13 years 5 months ago
On expectation maximization based channel and noise estimation beyond the vector Taylor series expansion
In this work, we show how expectation maximization based simultaneous channel and noise estimation can be derived without a vector Taylor series expansion. The central idea is to ...
Friedrich Faubel, John W. McDonough, Dietrich Klak...
PEPM
1994
ACM
13 years 9 months ago
The Essence of Eta-Expansion in Partial Evaluation
Abstract. Selective eta-expansion is a powerful "binding-time improvement", i.e., a sourceprogram modification that makes a partial evaluator yield better results. But li...
Olivier Danvy, Karoline Malmkjær, Jens Palsb...