3038 search results - page 157 / 608 » High-Speed Function Approximation |
146
click to vote
COCO
2003
Springer
15 years 11 months ago
2003
Springer
In this paper we give new extremal bounds on polynomial threshold function (PTF) representations of Boolean functions. Our results include the following: • Almost every Boolean ...
165
Voted
SFP
2001
15 years 7 months ago
2001
: We study type checking that is complete in the sense that it accepts every program whose subexpressions can all be executed without raising a type error at runtime. In a complete...
154
click to vote
CSMR
2007
IEEE
16 years 14 days ago
2007
IEEE
Many of the existing techniques for impact set computation in change propagation and regression testing are approximate for the sake of efficiency. A way to improve precision is ...
167
click to vote
VISUALIZATION
2005
IEEE
15 years 11 months ago
2005
IEEE
Techniques in numerical simulation such as the finite element method depend on basis functions for approximating the geometry and variation of the solution over discrete regions ...
142
click to vote
FOCM
2011
2011
Accuracy and Stability of Computing High-order Derivatives of Analytic Functions by Cauchy Integrals
15 years 1 months ago
Abstract High-order derivatives of analytic functions are expressible as Cauchy integrals over circular contours, which can very effectively be approximated, e.g., by trapezoidal s...