Sciweavers

1222 search results - page 79 / 245
» corr 2008
Sort
View
CORR
2008
Springer
50views Education» more  CORR 2008»
15 years 6 months ago
When are two algorithms the same?
People usually regard algorithms as more abstract than the programs that implement them. The natural way to formalize this idea is that algorithms are equivalence classes of progra...
Andreas Blass, Nachum Dershowitz, Yuri Gurevich
CORR
2008
Springer
96views Education» more  CORR 2008»
15 years 6 months ago
A Sparse Flat Extension Theorem for Moment Matrices
In this note we prove a generalization of the flat extension theorem of Curto and Fialkow [4] for truncated moment matrices. It applies to moment matrices indexed by an arbitrary s...
Monique Laurent, Bernard Mourrain
CORR
2008
Springer
109views Education» more  CORR 2008»
15 years 6 months ago
EuSpRIG 2006 Commercial Spreadsheet Review
This management summary provides an outline of a commercial spreadsheet review process. The aim of this process is to ensure remedial or enhancement work can safely be undertaken ...
Simon Murphy
CORR
2008
Springer
111views Education» more  CORR 2008»
15 years 6 months ago
A model for reactive porous transport during re-wetting of hardened concrete
A mathematical model is developed that captures the transport of liquid water in hardened concrete, as well as the chemical reactions that occur between the imbibed water and the r...
Michael Chapwanya, Wentao Liu, John M. Stockie
CORR
2008
Springer
104views Education» more  CORR 2008»
15 years 6 months ago
The Case for Structured Random Codes in Network Capacity Theorems
Random coding arguments are the backbone of most channel capacity achievability proofs. In this paper, we show that in their standard form, such arguments are insufficient for pro...
Bobak Nazer, Michael Gastpar