Results 1  10
of
18,893
The Exact Computation Paradigm
, 1994
"... We describe a paradigm for numerical computing, based on exact computation. This emerging paradigm has many advantages compared to the standard paradigm which is based on fixedprecision. We first survey the literature on multiprecision number packages, a prerequisite for exact computation. Next ..."
Abstract

Cited by 104 (12 self)
 Add to MetaCart
We describe a paradigm for numerical computing, based on exact computation. This emerging paradigm has many advantages compared to the standard paradigm which is based on fixedprecision. We first survey the literature on multiprecision number packages, a prerequisite for exact computation
Computability versus Exact Computability of Martingales
"... This note gives a simple example of a polynomial time computable martingale that has rational values but is not exactly computable. ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This note gives a simple example of a polynomial time computable martingale that has rational values but is not exactly computable.
Computability versus Exact Computability of Martingales*
"... Abstract This note gives a simple example of a polynomial time computable martingale that hasrational values but is not exactly computable. ..."
Abstract
 Add to MetaCart
Abstract This note gives a simple example of a polynomial time computable martingale that hasrational values but is not exactly computable.
Exact Computational Geometry and Tolerancing Metrology
, 1994
"... We describe the relevance of Computational Geometry to tolerancing metrology. We outline the basic issues and define the class of zone problems that is central in this area. In the context of the exact computation paradigm, these problems are prime candidates for "exact solution" since we ..."
Abstract

Cited by 24 (6 self)
 Add to MetaCart
We describe the relevance of Computational Geometry to tolerancing metrology. We outline the basic issues and define the class of zone problems that is central in this area. In the context of the exact computation paradigm, these problems are prime candidates for "exact solution" since we
KodairaSpencer theory of gravity and exact results for quantum string amplitudes
 Commun. Math. Phys
, 1994
"... We develop techniques to compute higher loop string amplitudes for twisted N = 2 theories with ĉ = 3 (i.e. the critical case). An important ingredient is the discovery of an anomaly at every genus in decoupling of BRST trivial states, captured to all orders by a master anomaly equation. In a particu ..."
Abstract

Cited by 540 (59 self)
 Add to MetaCart
We develop techniques to compute higher loop string amplitudes for twisted N = 2 theories with ĉ = 3 (i.e. the critical case). An important ingredient is the discovery of an anomaly at every genus in decoupling of BRST trivial states, captured to all orders by a master anomaly equation. In a
Experimental Mathematics and Exact Computation
, 2000
"... Computation in Mathematics is fast becoming ubiquitous. My intention is to discuss \pure and applied experimental computation " from a mathematician's perspective. I shall try to illustrate what is currently easy and what is currently hard, what is possible and what we aspire to be be abl ..."
Abstract
 Add to MetaCart
to be be able to do. I shall discuss a few of the underlying philosophical issues and shall also summarize some of the very demanding exact (hybrid symbolic/ numeric) computations I have undertaken in the last few years with David Bailey, David Bradley, David Broadhurst, Petr Lisonek, Peter Borwein and others.
Exact computation of the halfspace depth
, 2014
"... We suggest a theoretical framework for computing the exact value of the halfspace depth of a point z w.r.t. a data cloud x1,...,xn of n points in arbitrary dimension. Based on this framework a whole class of algorithms can be derived. In all of these algorithms the depth is calculated as the minimum ..."
Abstract
 Add to MetaCart
We suggest a theoretical framework for computing the exact value of the halfspace depth of a point z w.r.t. a data cloud x1,...,xn of n points in arbitrary dimension. Based on this framework a whole class of algorithms can be derived. In all of these algorithms the depth is calculated
Exact Computations in the Burgers Problem
, 1996
"... We complete the program outlined in the paper of the author with A. Migdal and sum up exactly all the fluctuations around the instanton solution of the randomly large scale driven Burgers equation. The probability distribution coincides with the one conjectured by A. Polyakov within the applicabilit ..."
Abstract
 Add to MetaCart
We complete the program outlined in the paper of the author with A. Migdal and sum up exactly all the fluctuations around the instanton solution of the randomly large scale driven Burgers equation. The probability distribution coincides with the one conjectured by A. Polyakov within
Exact Computational Analyses for Adaptive Designs
, 1993
"... We show how to compute optimal designs and exact analyses of allocation rules for various sequential allocation problems. The problems we have solved include parameter estimation in an industrial scenario, and testing in a clinical trial. Our computational approach incorporates backward induction, d ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
We show how to compute optimal designs and exact analyses of allocation rules for various sequential allocation problems. The problems we have solved include parameter estimation in an industrial scenario, and testing in a clinical trial. Our computational approach incorporates backward induction
Results 1  10
of
18,893