12289 search results - page 101 / 2458 » computing 2006 |
108
click to vote
COMPUTING
2006
15 years 3 months ago
2006
With respect to a wavelet basis, singular integral operators can be well approximated by sparse matrices, and in [Found. Comput. Math., 2 (2002), pp. 203
115
click to vote
JSC
2006
15 years 3 months ago
2006
We propose fast algorithms for computing composed products and composed sums, as well as diamond products of univariate polynomials. These operations correspond to special multiva...
123
click to vote
FUIN
2007
15 years 3 months ago
2007
We present the development of a theory of stored threads and their execution. The work builds upon Maurer’s theory of computer instructions and the thread algebra of Bergstra et ...
110
click to vote
IPL
2000
15 years 2 months ago
2000
We present a fast algorithm for computing large Fibonacci numbers. It is known that the product of Lucas numbers algorithm uses the fewest bit operations to compute the Fibonacci ...
ICDCSW
2006
IEEE
15 years 9 months ago
2006
IEEE