16430 search results - page 923 / 3286 » On Computable Tree Functions |
228
click to vote
FLAIRS
2008
15 years 10 months ago
2008
Rule extraction is a technique aimed at transforming highly accurate opaque models like neural networks into comprehensible models without losing accuracy. G-REX is a rule extract...
207
click to vote
PC
2007
15 years 7 months ago
2007
Abstract. In this paper, we focus on MPI collective algorithm selection process and explore the applicability of the quadtree encoding method to this problem. During the algorithm ...
185
click to vote
TLCA
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. Predicative analysis of recursion schema is a method to characterize complexity classes like the class of polynomial time functions. This analysis comes from the works of...
197
click to vote
ISSAC
1995
Springer
15 years 11 months ago
1995
Springer
Dynamic evaluation is a technique for producing multiple results according to a decision tree which evolves with program execution. Sometimes it is desired to produce results for ...
194
click to vote
IEEECGIV
2009
IEEE
16 years 2 months ago
2009
IEEE
—There are several methods used for plotting curves in CAGD, e.g., by directly computing their basis functions (polynomials) or using their recursive algorithms. For the former m...