347 search results - page 21 / 70 » Computable Versions of Basic Theorems in Functional Analysis |
191
click to vote
POPL
2006
ACM
16 years 3 days ago
2006
ACM
Abstract. This paper investigates what is essentially a call-by-value version of PCF under a complexity-theoretically motivated type system. The programming formalism, ATR, has its...
ICLP
2007
Springer
15 years 3 months ago
2007
Springer
We present a static analysis that infers both upper and lower bounds on the usage that a logic program makes of a set of user-definable resources. The inferred bounds will in gener...
101
click to vote
BIRTHDAY
2010
Springer
15 years 28 days ago
2010
Springer
Many natural problems in computer science concern structures like graphs where elements are not inherently ordered. In contrast, Turing machines and other common models of computa...
106
click to vote
TSMC
2002
14 years 11 months ago
2002
By exploiting the Fourier series expansion, we have developed a new constructive method of automatically generating a multivariable fuzzy inference system from any given sample set...
109
click to vote
ERCIMDL
2001
Springer
15 years 4 months ago
2001
Springer
The cultural heritage domain dealing with digital surrogates of rare and fragile historic artifacts is one of the most promising areas for establishing collaboratories, i.e. shared...