| P12-1013 | contribution of the paper is an efficient | polynomial approximation | algorithm for learning entailment |
| J15-2003 | main contribution is a heuristic | polynomial approximation | algorithm that can learn entailment |
| W04-1017 | algorithm is the best possible | polynomial approximation | algorithm for this problem . |
| C73-2010 | were computed by least-squares | polynomial approximation | on the logarithmic diagram . |
| J79-1016 | some " triangular " ) and the | polynomial approximations | . Of the shapes he studied , |
| P04-1051 | NPcomplete and does n't even admit | polynomial approximation | algorithms ( unless P = NP ) |
| J15-2003 | exploit this assumption to develop a | polynomial approximation | algorithm for learning entailment |
| J79-1016 | 6 , page 14 , shows that of a | polynomial approximation | . The over-all falloff of the |
| H05-1082 | the eight extraction databases . | Polynomial approximations | were fitted against both the |
| P84-1091 | translated into a z score using a | polynomial approximation | ( Abramowitz and Stegun 1970 |
| J79-1016 | generating glottal waves using the | polynomial approximation | . Values of pitch ( P ) and zero-to-peak |
| C04-1057 | that this algorithm is the best | polynomial approximation | algorithm for the problem ( Hochbaum |
| J79-1016 | Rosenberg 's equations for the | polynomial approximation | are used in GLOT ; to get the |
