3356 search results - page 309 / 672 » Computing education for sustainability |
176
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
In [12] we showed that a large class of fast recursive matrix multiplication algorithms is stable in a normwise sense, and that in fact if multiplication of n-by-n matrices can be...
162
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
ABSTRACT. This note presents absolute bounds on the size of the coefficients of the characteristic and minimal polynomials depending on the size of the coefficients of the associat...
131
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
In a previous paper we have suggested a number of ideas to attack circuit size complexity with cohomology. As a simple example, we take circuits that can only compute the AND of t...
115
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
We present a method for determining the one-dimensional submodules of a Laurent-Ore module. The method is based on a correspondence between hyperexponential solutions of associate...
153
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
This paper describes a method for risk analysis based on the approach used in CRAMM, but instead of using discrete measures for threats and vulnerabilities and lookup tables to de...