417 search results - page 39 / 84 » Fast Methods for Solving Linear Diophantine Equations |
126
click to vote
SIAMSC
2010
14 years 6 months ago
2010
The fast Gauss transform allows for the calculation of the sum of N Gaussians at M points in O(N + M) time. Here, we extend the algorithm to a wider class of kernels, motivated by ...
DAGSTUHL
2007
15 years 1 months ago
2007
In this paper we give a specification of a new block cipher that can be called the Courtois Toy Cipher (CTC). It is quite simple, and yet very much like any other known block ciph...
RC
2002
14 years 11 months ago
2002
A new method to decide the invertibility of a given high-dimensional function over a domain is presented. The problem arises in the field of verified solution of differential algeb...
ICMCS
2005
IEEE
15 years 5 months ago
2005
IEEE
This paper proposes a new animation editing method for creating animations from a single texture image. A standard warping method can not handle a physical motion effect because o...
113
click to vote
EGH
2003
Springer
15 years 5 months ago
2003
Springer
—We present a method for using programmable graphics hardware to solve a variety of boundary value problems. The time-evolution of such problems is frequently governed by partial...