Sciweavers

13784 search results - page 88 / 2757
» On Computing Functions with Uncertainty
Sort
View
CCA
2009
Springer
14 years 3 months ago
Computability of Probability Distributions and Distribution Functions
We define the computability of probability distributions on the real line as well as that of distribution functions. Mutual relationships between the computability notion of a pro...
Takakazu Mori, Yoshiki Tsujii, Mariko Yasugi
DCG
2006
82views more  DCG 2006»
13 years 9 months ago
Volume Computation for Polytopes and Partition Functions for Classical Root Systems
This paper presents an algorithm to compute the value of the inverse Laplace transforms of rational functions with poles on arrangements of hyperplanes. As an application, we prese...
M. Welleda Baldoni-Silva, Matthias Beck, Charles C...
ICALP
2004
Springer
14 years 2 months ago
An Analog Characterization of Elementarily Computable Functions over the Real Numbers
Abstract We present an analog and machine-independent algebraic characterization of elementarily computable functions over the real numbers in the sense of recursive analysis: we p...
Olivier Bournez, Emmanuel Hainry
ANTS
1998
Springer
112views Algorithms» more  ANTS 1998»
14 years 1 months ago
Unit Computation in Purely Cubic Function Fields of Unit Rank 1
Abstract. This paper describes a method for computing the fundamental unit and regulator of a purely cubic congruence function field of unit
Renate Scheidler, Andreas Stein
TPHOL
1996
IEEE
14 years 1 months ago
Synthetic Domain Theory in Type Theory: Another Logic of Computable Functions
We will present a Logic of Computable Functions based on the idea of Synthetic Domain Theory such that all functions are automatically continuous. Its implementation in the Lego pr...
Bernhard Reus