Sciweavers

1403 search results - page 12 / 281
» About Approximations of Exponentials
Sort
View
CHES
2000
Springer
114views Cryptology» more  CHES 2000»
15 years 1 months ago
Montgomery Exponentiation with no Final Subtractions: Improved Results
The Montgomery multiplication is commonly used as the core algorithm for cryptosystems based on modular arithmetic. With the advent of new classes of attacks (timing attacks, power...
Gaël Hachez, Jean-Jacques Quisquater
ATAL
2008
Springer
14 years 11 months ago
The permutable POMDP: fast solutions to POMDPs for preference elicitation
The ability for an agent to reason under uncertainty is crucial for many planning applications, since an agent rarely has access to complete, error-free information about its envi...
Finale Doshi, Nicholas Roy
CC
2002
Springer
126views System Software» more  CC 2002»
14 years 9 months ago
On the hardness of approximating the permanent of structured matrices
We show that for several natural classes of "structured" matrices, including symmetric, circulant, Hankel and Toeplitz matrices, approximating the permanent modulo a prim...
Bruno Codenotti, Igor Shparlinski, Arne Winterhof
ECML
2004
Springer
15 years 2 months ago
Filtered Reinforcement Learning
Reinforcement learning (RL) algorithms attempt to assign the credit for rewards to the actions that contributed to the reward. Thus far, credit assignment has been done in one of t...
Douglas Aberdeen
103
Voted
ICIP
2010
IEEE
14 years 6 months ago
Entropies and cross-entropies of exponential families
Statistical modeling of images plays a crucial role in modern image processing tasks like segmentation, object detection and restoration. Although Gaussian distributions are conve...
Frank Nielsen, Richard Nock