Sciweavers

417 search results - page 39 / 84
» Fast Methods for Solving Linear Diophantine Equations
Sort
View
SIAMSC
2010
159views more  SIAMSC 2010»
13 years 3 months ago
The Fast Generalized Gauss Transform
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 ...
Marina Spivak, Shravan K. Veerapaneni, Leslie Gree...
DAGSTUHL
2007
13 years 10 months ago
How Fast can be Algebraic Attacks on Block Ciphers?
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...
Nicolas Courtois
RC
2002
96views more  RC 2002»
13 years 8 months ago
Verification of Invertibility of Complicated Functions over Large Domains
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...
Jens Hoefkens, Martin Berz
ICMCS
2005
IEEE
130views Multimedia» more  ICMCS 2005»
14 years 2 months ago
The photodynamic tool: generation of animation from a single texture image
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...
Hidetomo Sakaino
EGH
2003
Springer
14 years 1 months ago
A multigrid solver for boundary value problems using programmable graphics hardware
—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...
Nolan Goodnight, Cliff Woolley, Gregory Lewin, Dav...