28888 search results - page 416 / 5778 » Computability and complexity in analysis |
177
click to vote
CAIP
1999
Springer
15 years 11 months ago
1999
Springer
Abstract. In this article, we deal with fast algorithms for the quaternionic Fourier transform (QFT). Our aim is to give a guideline for choosing algorithms in practical cases. Hen...
173
Voted
PE
2002
Springer
15 years 6 months ago
2002
Springer
Today many formalisms exist for specifying complex Markov chains. In contrast, formalisms for specifying rewards, enabling the analysis of long-run average performance properties,...
284
click to vote
BIOCOMP
2010
15 years 4 months ago
2010
Abstract-- Modeling the intermolecular reactions in a single cell is a critical problem in computational biology. Biochemical reaction systems often involve species in both low and...
224
click to vote
PODS
2012
ACM
13 years 9 months ago
2012
ACM
We show that randomization can lead to significant improvements for a few fundamental problems in distributed tracking. Our basis is the count-tracking problem, where there are k...
183
click to vote
ISSAC
2004
Springer
16 years 6 days ago
2004
Springer
In this paper, we present a truncated version of the classical Fast Fourier Transform. When applied to polynomial multiplication, this algorithm has the nice property of eliminati...