Sciweavers

413 search results - page 20 / 83
» Lattice Boltzmann Method
Sort
View
PKC
2010
Springer
138views Cryptology» more  PKC 2010»
14 years 12 days ago
Maximizing Small Root Bounds by Linearization and Applications to Small Secret Exponent RSA
We present an elementary method to construct optimized lattices that are used for finding small roots of polynomial equations. Former methods first construct some large lattice i...
Mathias Herrmann, Alexander May
COMBINATORICS
1998
86views more  COMBINATORICS 1998»
13 years 8 months ago
Lattice Tilings by Cubes: Whole, Notched and Extended
We discuss some problems of lattice tiling via Harmonic Analysis methods. We consider lattice tilings of Rd by the unit cube in relation to the Minkowski Conjecture (now a theorem...
Mihail N. Kolountzakis
ICCS
2003
Springer
14 years 1 months ago
Counting Polyominoes: A Parallel Implementation for Cluster Computing
The exact enumeration of most interesting combinatorial problems has exponential computational complexity. The finite-lattice method reduces this complexity for most two-dimension...
Iwan Jensen
SC
2000
ACM
14 years 25 days ago
Parallel Algorithms for Radiation Transport on Unstructured Grids
The method of discrete ordinates is commonly used to solve the Boltzmann radiation transport equation for applications ranging from simulations of fires to weapons effects. The ...
Steve Plimpton, Bruce Hendrickson, Shawn Burns, Wi...
MOR
2006
81views more  MOR 2006»
13 years 8 months ago
Simulated Annealing for Convex Optimization
We apply the method known as simulated annealing to the following problem in convex optimization: minimize a linear function over an arbitrary convex set, where the convex set is ...
Adam Tauman Kalai, Santosh Vempala