Sciweavers

1449 search results - page 31 / 290
» Self-Randomized Exponentiation Algorithms
Sort
View
109
Voted
COLOGNETWENTE
2010
14 years 11 months ago
Complexity of O'Hara's Algorithm
In this paper we analyze O’Hara’s partition bijection. We present three type of results. First, we show that O’Hara’s bijection can be viewed geometrically as a certain sci...
Matjaz Konvalinka, Igor Pak
ARITH
2007
IEEE
15 years 6 months ago
Spectral Modular Exponentiation
We describe a new method to perform the modular exponentiation operation, i.e., the computation of c = me mod n, where c, m, e and n are large integers. The new method uses the di...
Gökay Saldamli, Çetin Kaya Koç
NIPS
2001
15 years 1 months ago
Efficiency versus Convergence of Boolean Kernels for On-Line Learning Algorithms
The paper studies machine learning problems where each example is described using a set of Boolean features and where hypotheses are represented by linear threshold elements. One ...
Roni Khardon, Dan Roth, Rocco A. Servedio
IEEEIAS
2009
IEEE
15 years 7 months ago
Network Security Situation Awareness Using Exponential and Logarithmic Analysis
: Network security situation awareness (NSSA) is a hotspot in the network security research field, and it’s the perception, comprehension, and forecast of network security situat...
Xiaobin Tan, Qin Guihong, Zhang Yong, Liang Ping
107
Voted
COCO
2001
Springer
122views Algorithms» more  COCO 2001»
15 years 5 months ago
Hausdorff Dimension in Exponential Time
In this paper we investigate effective versions of Hausdorff dimension which have been recently introduced by Lutz. We focus on dimension in the class E of sets computable in line...
Klaus Ambos-Spies, Wolfgang Merkle, Jan Reimann, F...