111 search results - page 9 / 23 » Third-Order Computation and Bounded Arithmetic |
DAGSTUHL
2008
13 years 9 months ago
2008
Abstract. Having good estimates or even bounds for the error in computing approximations to expressions of the form f(A)v is very important in practical applications. In this paper...
CVPR
2001
IEEE
14 years 9 months ago
2001
IEEE
In this paper we describe a statistical method for the integration of an unlimited number of cues within a deformable model framework. We treat each cue as a random variable, each...
DAGSTUHL
2003
13 years 8 months ago
2003
In this paper we discuss reliable methods in the field of finite precision geometry. We begin with a brief survey of geometric computing and approaches generally used in dealing ...
COCO
1997
Springer
13 years 11 months ago
1997
Springer
We study families of Boolean circuits with the property that the number of gates at distance t fanning into or out of any given gate in a circuit is bounded above by a polynomial ...
APAL
2005
13 years 7 months ago
2005
Abstract. There is a very simple way in which the safe/normal variable discipline of Bellantoni-Cook recursion (1992) can be imposed on arithmetical theories like PA: quantify over...