Sciweavers

1449 search results - page 10 / 290
» Self-Randomized Exponentiation Algorithms
Sort
View
93
Voted
PKC
1999
Springer
94views Cryptology» more  PKC 1999»
15 years 4 months ago
Low-Cost Double-Size Modular Exponentiation or How to Stretch Your Cryptoprocessor
Public-key implementers often face strong hardware-related constraints. In particular, modular operations required in most cryptosystems generally constitute a computational bottle...
Pascal Paillier
NAACL
2004
15 years 1 months ago
Exponential Priors for Maximum Entropy Models
Maximum entropy models are a common modeling technique, but prone to overfitting. We show that using an exponential distribution as a prior leads to bounded absolute discounting b...
Joshua Goodman
CCR
2008
75views more  CCR 2008»
15 years 14 days ago
Removing exponential backoff from TCP
The well-accepted wisdom is that TCP's exponential backoff mechanism, introduced by Jacobson 20 years ago, is essential for preserving the stability of the Internet. In this ...
Amit Mondal, Aleksandar Kuzmanovic
JMLR
2010
135views more  JMLR 2010»
14 years 7 months ago
An Exponential Model for Infinite Rankings
This paper presents a statistical model for expressing preferences through rankings, when the number of alternatives (items to rank) is large. A human ranker will then typically r...
Marina Meila, Le Bao
CORR
2008
Springer
70views Education» more  CORR 2008»
15 years 14 days ago
Universal Coding on Infinite Alphabets: Exponentially Decreasing Envelopes
This paper deals with the problem of universal lossless coding on a countable infinite alphabet. It focuses on some classes of sources defined by an envelope condition on the margi...
Dominique Bontemps