Sciweavers

10890 search results - page 246 / 2178
» Automatic Complexity Analysis
Sort
View
CRYPTO
2007
Springer
133views Cryptology» more  CRYPTO 2007»
16 years 21 days ago
Amplifying Collision Resistance: A Complexity-Theoretic Treatment
We initiate a complexity-theoretic treatment of hardness amplification for collision-resistant hash functions, namely the transformation of weakly collision-resistant hash functio...
Ran Canetti, Ronald L. Rivest, Madhu Sudan, Luca T...
ICA
2007
Springer
16 years 21 days ago
A Robust Complex FastICA Algorithm Using the Huber M-Estimator Cost Function
In this paper, we propose to use the Huber M-estimator cost function as a contrast function within the complex FastICA algorithm of Bingham and Hyvarinen for the blind separation o...
Jih-Cheng Chao, Scott C. Douglas
ICSEA
2006
IEEE
16 years 17 days ago
Extracting Simulation Models from Complex Embedded Real-Time Systems
A modeling process is presented for extracting timingaccurate simulation models from complex embedded realtime systems. The process is supported by two complementary methods for t...
Johan Andersson, Joel Huselius, Christer Norstr&ou...
ICA
2004
Springer
15 years 12 months ago
Unraveling Spatio-temporal Dynamics in fMRI Recordings Using Complex ICA
Abstract. Independent component analysis (ICA) of functional magnetic resonance imaging (fMRI) data is commonly carried out under the assumption that each source may be represented...
Jörn Anemüller, Jeng-Ren Duann, Terrence...
APL
1998
ACM
15 years 10 months ago
Reducing computational complexity with array predicates
This article describes how array predicates were used to reduce the computational complexity of four APL primitive functions when one of their arguments is a permutation vector. T...
Robert Bernecky