1469 search results - page 130 / 294 » Approximate polynomial decomposition |
EUROPAR
2010
Springer
14 years 10 months ago
2010
Springer
We present in this article a new approximation algorithm for scheduling a set of n independent rigid (meaning requiring a fixed number of processors) jobs on hierarchical parallel ...
IJAR
2010
14 years 8 months ago
2010
Credal nets generalize Bayesian nets by relaxing the requirement of precision of probabilities. Credal nets are considerably more expressive than Bayesian nets, but this makes bel...
SEMWEB
2010
Springer
14 years 7 months ago
2010
Springer
We develop query relaxation techniques for regular path queries and combine them with query approximation in order to support flexible querying of RDF data when the user lacks know...
CC
2010
Springer
14 years 7 months ago
2010
Springer
We prove that the concept class of disjunctions cannot be pointwise approximated by linear combinations of any small set of arbitrary real-valued functions. That is, suppose that t...
JAT
2010
14 years 4 months ago
2010
For r 3, n N and each 3-monotone continuous function f on [a, b] (i.e., f is such that its third divided differences [x0, x1, x2, x3] f are nonnegative for all choices of distin...