1279 search results - page 71 / 256 » Fast Implementations of Automata Computations |
151
Voted
JCPHY
2011
14 years 5 months ago
2011
The calculation of radial distribution functions (RDFs) from molecular dynamics trajectory data is a common and computationally expensive analysis task. The rate limiting step in ...
110
Voted
IPPS
2007
IEEE
15 years 8 months ago
2007
IEEE
Fault tolerance is an important issue for large machines with tens or hundreds of thousands of processors. Checkpoint-based methods, currently used on most machines, rollback all ...
114
click to vote
SIPS
2007
IEEE
15 years 8 months ago
2007
IEEE
OFDM demodulation under fast fading radio channels is very computationally demanding, making the implementation of Software Defined Radio (SDR) solutions problematic. A suboptima...
403
Voted
Publication
We develop a fast method to localize the level set method of Osher and Sethian (1988, Journal of Computational Physics) and address two important issues that are intrinsic to the l...
134
click to vote
ASAP
2009
IEEE
15 years 12 days ago
2009
IEEE
This paper examines the architecture, algorithm and implementation of a switch-based multi-processor realization of the fast Fourier transform (FFT). The architecture employs M pr...