968 search results - page 4 / 194 » A faster implementation of APlace |
SODA
2001
ACM
13 years 8 months ago
2001
ACM
We give an implementation of the Goemans-Williamson clustering procedure which is at the core of several approximation algorithms including those for Generalized Steiner Trees, Pr...
IPPS
2010
IEEE
13 years 5 months ago
2010
IEEE
The Smith-Waterman (SW) algorithm is one of the widely used algorithms for sequence alignment in computational biology. With the growing size of the sequence database, there is alw...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
We present a software-only implementation of an IEEE 802.11a (WiFi) receiver optimized for Intel multicore platforms. The receiver is about 50 times faster than a straightforward ...
INTERSPEECH
2010
13 years 2 months ago
2010
Decision tree-based context clustering is the essential but timeconsuming part of building HMM-based speech synthesis systems. The widely used implementation of this technique is ...
CHES
2009
Springer
14 years 8 months ago
2009
Springer
We present a bitsliced implementation of AES encryption in counter mode for 64-bit Intel processors. Running at 7.59 cycles/byte on a Core 2, it is up to 25% faster than previous i...