1092 search results - page 49 / 219 » Polynomial Interpretations and the Complexity of Algorithms |
ICASSP
2011
IEEE
14 years 3 months ago
2011
IEEE
A novel framework for the factorisation of complex-valued data is derived using recent developments in complex statistics. Unlike existing factorisation tools the algorithms can c...
111
click to vote
STACS
2000
Springer
15 years 3 months ago
2000
Springer
Abstract. We compare classical and quantum query complexities of total Boolean functions. It is known that for worst-case complexity, the gap between quantum and classical can be a...
187
click to vote
ICDE
2008
IEEE
16 years 1 months ago
2008
IEEE
This work introduces novel polynomial algorithms for processing top-k queries in uncertain databases under the generally adopted model of x-relations. An x-relation consists of a n...
CORR
2004
Springer
14 years 11 months ago
2004
Springer
We give a new type inference algorithm for typing lambda-terms in Elementary Affine Logic (EAL), which is motivated by applications to complexity and optimal reduction. Following p...
119
click to vote
CORR
2010
Springer
14 years 6 months ago
2010
Springer
In this paper we show how we can compute in a deterministic way the decomposition of a multivariate rational function with a recombination strategy. The key point of our recombinat...