Sciweavers

2374 search results - page 96 / 475
» Fast Distributed Algorithms for Computing Separable Function...
Sort
View
CEC
2008
IEEE
15 years 4 months ago
A particle swarm optimizer with lifespan for global optimization on multimodal functions
—The particle swarm optimizer (PSO) is a popular computing technique of swarm intelligence, known for its fast convergence speed and easy implementation. All the particles in the...
Jun Zhang, Ying Lin
JOC
1998
162views more  JOC 1998»
14 years 9 months ago
A Software-Optimized Encryption Algorithm
We describe a software-e cient encryption algorithm named SEAL 3.0. Computational cost on a modern 32-bit processor is about 4 clock cycles per byte of text. The cipher is a pseudo...
Phillip Rogaway, Don Coppersmith
PPOPP
2012
ACM
13 years 5 months ago
A methodology for creating fast wait-free data structures
Lock-freedom is a progress guarantee that ensures overall program progress. Wait-freedom is a stronger progress guarantee that ensures the progress of each thread in the program. ...
Alex Kogan, Erez Petrank
ICMCS
2008
IEEE
151views Multimedia» more  ICMCS 2008»
15 years 4 months ago
Fast keyword detection with sparse time-frequency models
We address the problem of keyword spotting in continuous speech streams when training and testing conditions can be different. We propose a keyword spotting algorithm based on spa...
Effrosini Kokiopoulou, Pascal Frossard, Olivier Ve...
SPAA
2005
ACM
15 years 3 months ago
Fast construction of overlay networks
An asynchronous algorithm is described for rapidly constructing an overlay network in a peer-to-peer system where all nodes can in principle communicate with each other directly t...
Dana Angluin, James Aspnes, Jiang Chen, Yinghua Wu...