This paper proposes a fast algorithm, called the SpiralFFT, that computes samples of the 3-D discrete Fourier transform of an object of interest along spiral contours in frequency space. This type of sampling geometry is prevalent in 3-D magnetic resonance imaging, as spiral sampling patterns allow for rapid, uninterrupted scanning over a large range of frequencies. We show that parameterizing ...

H aving the "last word" in a company of this experience and distinction would be quite intimidating, were it indeed the end of something but the first and most important thing I have to say is that it must not be the last word! I hope this is the beginning of sustained dialogue and fruitful discussions between and among many of us who have newly or freshly recognized our common resolve in maint...

This paper introduces and investigates decision problems for numberless probabilistic automata, i.e. probabilistic automata where the support of each probabilistic transitions is specified, but the exact values of the probabilities are not. A numberless probabilistic automaton can be instantiated into a probabilistic automaton by specifying the exact values of the non-zero probabilistic transit...