Sciweavers

1415 search results - page 193 / 283
» Can Parallel Algorithms Enhance Serial Implementation
Sort
View
FSE
2008
Springer
91views Cryptology» more  FSE 2008»
13 years 10 months ago
SWIFFT: A Modest Proposal for FFT Hashing
We propose SWIFFT, a collection of compression functions that are highly parallelizable and admit very efficient implementations on modern microprocessors. The main technique under...
Vadim Lyubashevsky, Daniele Micciancio, Chris Peik...
CLUSTER
1999
IEEE
13 years 8 months ago
Experimental measurements and design guidelines for real-time software encryption in multimedia wireless LANs
To secure interactive multimedia applications in wireless LANs WLANs it is pertinent to implement real time cryptographic services. In this paper we evaluate the use of software b...
Aura Ganz, Se Hyun Park, Zvi Ganz
SAC
2009
ACM
14 years 3 months ago
GTfold: a scalable multicore code for RNA secondary structure prediction
The prediction of the correct secondary structures of large RNAs is one of the unsolved challenges of computational molecular biology. Among the major obstacles is the fact that a...
Amrita Mathuriya, David A. Bader, Christine E. Hei...
ICASSP
2009
IEEE
14 years 3 months ago
Bandwidth adaptive hardware architecture of K-Means clustering for intelligent video processing
K-Means is a clustering algorithm that is widely applied in many elds, including pattern classi cation and multimedia analysis. Due to real-time requirements and computational-cos...
Tse-Wei Chen, Shao-Yi Chien
ESCIENCE
2006
IEEE
14 years 3 months ago
Niching for Population-Based Ant Colony Optimization
Most Ant Colony Optimization (ACO) algorithms are able to find a single (or few) optimal, or near-optimal, solutions to difficult (NP-hard) problems. An issue though is that a s...
Daniel Angus