Sciweavers

8486 search results - page 31 / 1698
» Ordered Enumeration Method
Sort
View
ARITH
2003
IEEE
14 years 25 days ago
"Partially Rounded" Small-Order Approximations for Accurate, Hardware-Oriented, Table-Based Methods
We aim at evaluating elementary and special functions using small tables and small, rectangular, multipliers. To do that, we show how accurate polynomial approximations whose orde...
Jean-Michel Muller
AML
2006
103views more  AML 2006»
13 years 7 months ago
Decision methods for linearly ordered Heyting algebras
Abstract. The decision problem for positively quantified formulae in the theory of linearly ordered Heyting algebras is known, as a special case of work of Kreisel, to be solvable;...
Roy Dyckhoff, Sara Negri
JAR
2002
72views more  JAR 2002»
13 years 7 months ago
Partial Instantiation Methods for Inference in First-Order Logic
Satisfiability algorithms for propositional logic have improved enormously in recently years. This improvement increases the attractiveness of satisfiability methods for first-orde...
John N. Hooker, G. Rago, V. Chandru, A. Shrivastav...
SIGGRAPH
1993
ACM
13 years 11 months ago
Radiosity algorithms using higher order finite element methods
Many of the current radiosity algorithms create a piecewise constant approximation to the actual radiosity. Through interpolation and extrapolation, a continuous solution is obtai...
Roy Troutman, Nelson L. Max
IJCNN
2006
IEEE
14 years 1 months ago
Sparse Optimization for Second Order Kernel Methods
— We present a new optimization procedure which is particularly suited for the solution of second-order kernel methods like e.g. Kernel-PCA. Common to these methods is that there...
Roland Vollgraf, Klaus Obermayer