530 search results - page 29 / 106 » An Algorithm for Approximating the Satisfiability Problem of... |
CGO
2011
IEEE
12 years 11 months ago
2011
IEEE
—Approximating ideal program outputs is a common technique for solving computationally difficult problems, for adhering to processing or timing constraints, and for performance ...
JC
2008
13 years 7 months ago
2008
We study multivariate approximation for continuous functions in the average case setting. The space of d variate continuous functions is equipped with the zero mean Gaussian measu...
AISC
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. The Complete Root Classification for a univariate polynomial with symbolic coefficients is the collection of all the possible cases of its root classification, together w...
SIAMCOMP
1998
13 years 7 months ago
1998
Motivated by applications in computer graphics, visualization, and scienti c computation, we study the computational complexity of the following problem: Given a set S of n points...
AAAI
1992
13 years 9 months ago
1992
models require the identi cation of abstractions and approximations that are well suited to the task at hand. In this paper we analyze the problem of automatically selecting adequ...