Sciweavers

1279 search results - page 40 / 256
» Fast Implementations of Automata Computations
Sort
View
ICASSP
2011
IEEE
12 years 11 months ago
Fast algorithms for Iterative Adaptive Approach spectral estimation techniques
This paper presents computationally efficient implementations for Iterative Adaptive Approach (IAA) spectral estimation techniques for uniformly sampled data sets. By exploiting ...
George-Othon Glentis, Andreas Jakobsson
ICS
2001
Tsinghua U.
14 years 2 days ago
Integrating superscalar processor components to implement register caching
A large logical register file is important to allow effective compiler transformations or to provide a windowed space of registers to allow fast function calls. Unfortunately, a l...
Matt Postiff, David Greene, Steven E. Raasch, Trev...
SC
2005
ACM
14 years 1 months ago
ClawHMMER: A Streaming HMMer-Search Implementation
The proliferation of biological sequence data has motivated the need for an extremely fast probabilistic sequence search. One method for performing this search involves evaluating...
Daniel Reiter Horn, Mike Houston, Pat Hanrahan
PAIRING
2010
Springer
237views Cryptology» more  PAIRING 2010»
13 years 6 months ago
High-Speed Software Implementation of the Optimal Ate Pairing over Barreto-Naehrig Curves
This paper describes the design of a fast software library for the computation of the optimal ate pairing on a Barreto–Naehrig elliptic curve. Our library is able to compute the ...
Jean-Luc Beuchat, Jorge E. González-D&iacut...
ISSAC
2007
Springer
107views Mathematics» more  ISSAC 2007»
14 years 1 months ago
A disk-based parallel implementation for direct condensation of large permutation modules
Through the use of a new disk-based method for enumerating very large orbits, condensation for orbits with tens of billions of elements can be performed. The algorithm is novel in...
Eric Robinson, Jürgen Müller 0004, Gene ...