Sciweavers

1279 search results - page 26 / 256
» Fast Implementations of Automata Computations
Sort
View
EUROCRYPT
2006
Springer
13 years 11 months ago
Efficient Computation of Algebraic Immunity for Algebraic and Fast Algebraic Attacks
In this paper we propose several efficient algorithms for assessing the resistance of Boolean functions against algebraic and fast algebraic attacks when implemented in LFSRbased s...
Frederik Armknecht, Claude Carlet, Philippe Gabori...
CORR
2010
Springer
135views Education» more  CORR 2010»
13 years 7 months ago
Gravitational tree-code on graphics processing units: implementation in CUDA
We present a new very fast tree-code which runs on massively parallel Graphical Processing Units (GPU) with NVIDIA CUDA architecture. The tree-construction and calculation of mult...
Evghenii Gaburov, Jeroen Bédorf, Simon Port...
COMPGEOM
2000
ACM
13 years 12 months ago
Fast computation of generalized Voronoi diagrams using graphics hardware
: We present a new approach for computing generalized Voronoi diagrams in two and three dimensions using interpolation-based polygon rasterization hardware. The input primitives ma...
Kenneth E. Hoff III, Tim Culver, John Keyser, Ming...
CPHYSICS
2008
80views more  CPHYSICS 2008»
13 years 7 months ago
Fast clear-sky solar irradiation computation for very large digital elevation models
This paper presents a fast algorithm to compute the global clear-sky irradiation, appropriate for extended high-resolution Digital Elevation Models (DEMs). The latest equations pu...
Luis F. Romero, Siham Tabik, Jesús M. V&iac...
ESA
2003
Springer
111views Algorithms» more  ESA 2003»
14 years 24 days ago
Fast Smallest-Enclosing-Ball Computation in High Dimensions
Abstract. We develop a simple combinatorial algorithm for computing the smallest enclosing ball of a set of points in high dimensional Euclidean space. The resulting code is in mos...
Kaspar Fischer, Bernd Gärtner, Martin Kutz