Sciweavers

2767 search results - page 300 / 554
» Universal Exponentiation Algorithm
Sort
View
124
Voted
ARITH
2005
IEEE
15 years 8 months ago
Fast Modular Reduction for Large Wordlengths via One Linear and One Cyclic Convolution
Abstract— Modular reduction is a fundamental operation in cryptographic systems. Most well known modular reduction methods including Barrett’s and Montgomery’s algorithms lev...
Dhananjay S. Phatak, Tom Goff
114
Voted
FOCS
2005
IEEE
15 years 8 months ago
On Learning Mixtures of Heavy-Tailed Distributions
We consider the problem of learning mixtures of arbitrary symmetric distributions. We formulate sufficient separation conditions and present a learning algorithm with provable gua...
Anirban Dasgupta, John E. Hopcroft, Jon M. Kleinbe...
92
Voted
APPROX
2005
Springer
94views Algorithms» more  APPROX 2005»
15 years 8 months ago
Testing Periodicity
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...
Oded Lachish, Ilan Newman
119
Voted
ATAL
2005
Springer
15 years 8 months ago
Optimal design in collaborative design network
We consider a multiagent system whose task is to aid componentcentered design by collaborative designers in a supply chain. In the earlier work, collaborative design networks are ...
Y. Xiang, J. Chen, William S. Havens
ILP
2005
Springer
15 years 8 months ago
Online Closure-Based Learning of Relational Theories
Online learning algorithms such as Winnow have received much attention in Machine Learning. Their performance degrades only logarithmically with the input dimension, making them us...
Frédéric Koriche