Sciweavers

1418 search results - page 125 / 284
» Schema polynomials and applications
Sort
View
ARITH
2007
IEEE
16 years 20 days ago
Floating-point L2-approximations to functions
In the present paper, we investigate the approximation of a function by a polynomial with floating-point coefficients; we are looking for the best approximation in the L2 sense....
Nicolas Brisebarre, Guillaume Hanrot
COCO
2005
Springer
92views Algorithms» more  COCO 2005»
15 years 12 months ago
Monotone Circuits for Weighted Threshold Functions
Weighted threshold functions with positive weights are a natural generalization of unweighted threshold functions. These functions are clearly monotone. However, the naive way of ...
Amos Beimel, Enav Weinreb
WADS
2001
Springer
86views Algorithms» more  WADS 2001»
15 years 10 months ago
Practical Approximation Algorithms for Separable Packing Linear Programs
Abstract. We describe fully polynomial time approximation schemes for generalized multicommodity flow problems arising in VLSI applications such as Global Routing via Buffer Block...
Feodor F. Dragan, Andrew B. Kahng, Ion I. Mandoiu,...
PODS
2000
ACM
102views Database» more  PODS 2000»
15 years 10 months ago
Linear Approximation of Planar Spatial Databases Using Transitive-Closure Logic
We consider spatial databases in the plane that can be defined by polynomial constraint formulas. Motivated by applications in geographic information systems, we investigate line...
Floris Geerts, Bart Kuijpers
ISTCS
1995
Springer
15 years 10 months ago
Some Improvements to Total Degree Tests
A low-degree test is a collection of simple, local rules for checking the proximity of an arbitrary function to a lowdegree polynomial. Each rule depends on the function’s value...
Katalin Friedl, Madhu Sudan