59 search results - page 10 / 12 » Bounds and algebraic algorithms in differential algebra: the... |
TIM
2010
13 years 1 months ago
2010
Polynomial chaos theory (PCT) has been proven to be an efficient and effective way to represent and propagate uncertainty through system models and algorithms in general. In partic...
ICDE
2010
IEEE
14 years 6 months ago
2010
IEEE
Abstract-- This paper introduces a deterministic approximation algorithm with error guarantees for computing the probability of propositional formulas over discrete random variable...
CORR
2011
Springer
13 years 1 months ago
2011
Springer
We study the power of classical and quantum algorithms equipped with nonuniform advice, in the form of a coin whose bias encodes useful information. This question takes on particu...
CP
2007
Springer
14 years 26 days ago
2007
Springer
We introduce groupoids – generalisations of groups in which not all pairs of elements may be multiplied, or, equivalently, categories in which all morphisms are invertible – as...
AUTOMATICA
2008
13 years 6 months ago
2008
Fitting data by a bounded complexity linear model is equivalent to low-rank approximation of a matrix constructed from the data. The data matrix being Hankel structured is equival...