Sciweavers

1449 search results - page 167 / 290
» Self-Randomized Exponentiation Algorithms
Sort
View
CRYPTO
2011
Springer
179views Cryptology» more  CRYPTO 2011»
14 years 6 months ago
Smaller Decoding Exponents: Ball-Collision Decoding
Very few public-key cryptosystems are known that can encrypt and decrypt in time b2+o(1) with conjectured security level 2b against conventional computers and quantum computers. Th...
Daniel J. Bernstein, Tanja Lange, Christiane Peter...

Publication
189views
14 years 2 months ago
Mitigation of Visibility Loss for Advanced Camera based Driver Assistances
In adverse weather conditions, in particular, in day-light fog, the contrast of images grabbed by in-vehicle cameras in the visible light range is drastically degraded, which makes...
Nicolas Hautière, Jean-Philippe Tarel and Didier...

Presentation
439views
14 years 6 days ago
Efficient Evaluation Methods of Elementary Functions Suitable for SIMD Computation
Data-parallel architectures like SIMD (Single Instruction Multiple Data) or SIMT (Single Instruction Multiple Thread) have been adopted in many recent CPU and GPU architectures. Al...
ICML
2009
IEEE
16 years 7 months ago
Herding dynamical weights to learn
A new "herding" algorithm is proposed which directly converts observed moments into a sequence of pseudo-samples. The pseudosamples respect the moment constraints and ma...
Max Welling
STOC
2002
ACM
124views Algorithms» more  STOC 2002»
16 years 6 months ago
Clairvoyant scheduling of random walks
Two infinite walks on the same finite graph are called compatible if it is possible to introduce delays into them in such a way that they never collide. Years ago, Peter Winkler a...
Péter Gács