Sciweavers

104 search results - page 7 / 21
» A Survey of Fast Exponentiation Methods
Sort
View
BMCBI
2004
158views more  BMCBI 2004»
13 years 7 months ago
Incremental genetic K-means algorithm and its application in gene expression data analysis
Background: In recent years, clustering algorithms have been effectively applied in molecular biology for gene expression data analysis. With the help of clustering algorithms suc...
Yi Lu, Shiyong Lu, Farshad Fotouhi, Youping Deng, ...
ICRA
2005
IEEE
106views Robotics» more  ICRA 2005»
14 years 1 months ago
A Fast Online Gait Planning with Boundary Condition Relaxation for Humanoid Robots
— A fast online gait planning method is proposed. Based on an approximate dynamical biped model whose mass is concentrated to COG, general solution of the equation of motion is a...
Tomomichi Sugihara, Yoshihiko Nakamura
CORR
2010
Springer
90views Education» more  CORR 2010»
13 years 5 months ago
Fast Pseudo-Random Fingerprints
Abstract. We propose a method to exponentially speed up computation of various fingerprints, such as the ones used to compute similarity and rarity in massive data sets. Rather the...
Yoram Bachrach, Ely Porat
CRYPTO
2004
Springer
120views Cryptology» more  CRYPTO 2004»
14 years 1 months ago
Rewriting Variables: The Complexity of Fast Algebraic Attacks on Stream Ciphers
Recently proposed algebraic attacks [2, 6] and fast algebraic attacks [1, 5] have provided the best analyses against some deployed LFSR-based ciphers. The process complexity is exp...
Philip Hawkes, Gregory G. Rose
ARITH
2005
IEEE
14 years 1 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