1449 search results - page 240 / 290 » Self-Randomized Exponentiation Algorithms |
151
click to vote
ICTAI
2006
IEEE
16 years 18 hour ago
2006
IEEE
Sustained emerging spatio-temporal co-occurrence patterns (SECOPs) represent subsets of object-types that are increasingly located together in space and time. Discovering SECOPs i...
147
click to vote
INFOCOM
2006
IEEE
16 years 14 hour ago
2006
IEEE
— We consider the fundamental delay tradeoffs for minimizing energy expenditure in a multi-user wireless downlink with randomly varying channels. First, we extend the BerryGallag...
161
click to vote
ARITH
2005
IEEE
15 years 11 months ago
2005
IEEE
Abstract— Modular reduction is a fundamental operation in cryptographic systems. Most well known modular reduction methods including Barrett’s and Montgomery’s algorithms lev...
151
click to vote
FOCS
2005
IEEE
15 years 11 months ago
2005
IEEE
We consider the problem of learning mixtures of arbitrary symmetric distributions. We formulate sufficient separation conditions and present a learning algorithm with provable gua...
153
click to vote
APPROX
2005
Springer
15 years 11 months ago
2005
Springer
A string α ∈ Σn is called p-periodic, if for every i, j ∈ {1, . . . , n}, such that i ≡ j mod p, αi = αj, where αi is the i-th place of α. A string α ∈ Σn is said t...