Sciweavers

1945 search results - page 120 / 389
» Speeding up Serpent
Sort
View
ESOP
2000
Springer
15 years 10 months ago
Improving the Representation of Infinite Trees to Deal with Sets of Trees
In order to deal efficiently with infinite regular trees (or other pointed graph structures), we give new algorithms to store such structures. The trees are stored in such a way th...
Laurent Mauborgne
EUROCRYPT
2000
Springer
15 years 10 months ago
Analysis and Optimization of the TWINKLE Factoring Device
We describe an enhanced version of the TWINKLE factoring device and analyse to what extent it can be expected to speed up the sieving step of the Quadratic Sieve and Number Field S...
Arjen K. Lenstra, Adi Shamir
GECCO
2000
Springer
142views Optimization» more  GECCO 2000»
15 years 10 months ago
Improving EAs for Sequencing Problems
Sequencing problems have to be solved very often in VLSI CAD. To obtain results of high quality, Evolutionary Algorithms (EAs) have been successfully applied in many cases. Howeve...
Wolfgang Günther, Rolf Drechsler
AAAI
2007
15 years 8 months ago
Action-Space Partitioning for Planning
For autonomous artificial decision-makers to solve realistic tasks, they need to deal with searching through large state and action spaces under time pressure. We study the probl...
Natalia Hernandez-Gardiol, Leslie Pack Kaelbling
BILDMED
2008
125views Algorithms» more  BILDMED 2008»
15 years 7 months ago
Iterative Reconstruction of SPECT Images Using Adaptive Multi-level Refinement
We present a novel method for iterative reconstruction of high resolution images. Our method is based on the observation that constant regions in an image can be represented at muc...
Hanno Schumacher, Stefan Heldmann, Eldad Haber, Be...