1279 search results - page 66 / 256 » Fast Implementations of Automata Computations |
TCS
2010
13 years 6 months ago
2010
We define a subclass of timed automata, called oscillator timed automata, suitable to model biological oscillators. Coupled biological oscillators may synchronise, as emerging be...
CODES
2003
IEEE
14 years 1 months ago
2003
IEEE
This paper presents a software implementation of a very fast parallel Reed-Solomon decoder on the second generation of MorphoSys reconfigurable computation platform, which is targ...
ISM
2008
IEEE
14 years 2 months ago
2008
IEEE
Many multimedia applications rely on the computation of logarithms, for example, when estimating log-likelihoods for Gaussian Mixture Models. Knowing of the demand to compute loga...
ICCCN
2007
IEEE
14 years 2 months ago
2007
IEEE
Abstract—Sequencer, privilege-based, and communication history algorithms are popular approaches to implement total ordering, where communication history algorithms are most suit...
ICA
2007
Springer
14 years 1 months ago
2007
Springer
FastICA is arguably one of the most widespread methods for independent component analysis. We focus on its deflation-based implementation, where the independent components are ext...