268 search results - page 16 / 54 » Recursion Theoretic Operators for Function Complexity Classe... |
90
Voted
TOOLS
2008
IEEE
15 years 10 months ago
2008
IEEE
Abstract. Behavioral reflection is crucial to support for example functional upgrades, on-the-fly debugging, or monitoring critical applications. However the use of reflective f...
139
Voted
TCS
2011
14 years 10 months ago
2011
New, simple, proofs of soundness (every representable function lies in a given complexity class) for Elementary Affine Logic, LFPL and Soft Affine Logic are presented. The proofs ...
141
Voted
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
Empirical divergence maximization is an estimation method similar to empirical risk minimization whereby the Kullback-Leibler divergence is maximized over a class of functions tha...
135
Voted
ISSAC
2007
Springer
15 years 9 months ago
2007
Springer
We study arithmetic operations for triangular families of polynomials, concentrating on multiplication in dimension zero. By a suitable extension of fast univariate Euclidean divi...
109
Voted
TLCA
2005
Springer
15 years 9 months ago
2005
Springer
We use a fully abstract denotational model to show that nested function calls and recursive definitions can be eliminated from SPCF (a typed functional language with simple non-lo...