Sciweavers

16430 search results - page 111 / 3286
» On Computable Tree Functions
Sort
View
139
Voted
ARITH
2009
IEEE
15 years 10 months ago
Fast and Accurate Bessel Function Computation
The Bessel functions are considered relatively difficult to compute. Although they have a simple power series expansion that is everywhere convergent, they exhibit approximately ...
John Harrison
COMGEO
2006
ACM
15 years 3 months ago
A new algorithmic approach to the computation of Minkowski functionals of polyconvex sets
An algorithm is proposed for the simultaneous computation of all Minkowski functionals (except for the volume) of sets from the convex ring in Rd discretized with respect to a give...
Simone Klenk, Volker Schmidt, Evgueni Spodarev
141
Voted
PODC
2006
ACM
15 years 9 months ago
Computing separable functions via gossip
Motivated by applications to sensor, peer-to-peer, and adhoc networks, we study the problem of computing functions of values at the nodes in a network in a totally distributed man...
Damon Mosk-Aoyama, Devavrat Shah
DAC
1998
ACM
15 years 7 months ago
OCCOM: Efficient Computation of Observability-Based Code Coverage Metrics for Functional Verification
—Functional simulation is still the primary workhorse for verifying the functional correctness of hardware designs. Functional verification is necessarily incomplete because it i...
Farzan Fallah, Srinivas Devadas, Kurt Keutzer
113
Voted
ISSAC
2007
Springer
149views Mathematics» more  ISSAC 2007»
15 years 9 months ago
Computing numerically with functions instead of numbers
Symbolic computation with functions of a real variable suffers from combinatorial explosion of memory and computation time. The alternative chebfun system for such computations is...
Lloyd N. Trefethen