542 search results - page 2 / 109 » The Denjoy alternative for computable functions |
ARITH
2009
IEEE
13 years 11 months ago
2009
IEEE
The Bessel functions are considered relatively difficult to compute. Although they have a simple power series expansion that is everywhere convergent, they exhibit approximately ...
ECSQARU
1999
Springer
13 years 9 months ago
1999
Springer
Abstract. Given several Dempster-Shafer belief functions, the framework of valuation networks describes an efficient method for computing the marginal of the combined belief functi...
SC
2005
ACM
13 years 10 months ago
2005
ACM
: The Open Grid Services Architecture (OGSA) has been a major step forward for Grid Computing, but its de facto reliance on the Web Services Resource Framework (WSRF) and WSNotific...
FCT
2009
Springer
13 years 11 months ago
2009
Springer
Weighted automata are finite automata with numerical weights on transitions. Nondeterministic weighted automata define quantitative languages L that assign to each word w a real ...
CAGD
2005
13 years 4 months ago
2005
Morin and Goldman [Computer Aided Geometric Design 17 (2000) 813] have recently presented a remarkable new framework, based on employing Poisson series, for describing analytic fu...