[PDF] Top 20 PRL RR 1 pdf

... In this section, we have shown that a robust method for the computation of planar maps with linearly interpolated B´ezier curves requires at most b + ( k + 1) d bits for the forward differencing step and 4 b + 6 ... See full document

... multiplicands and summands (see [Lyo76], [BRV89] and [SBV91]). These multipliers are interfaced with an arbitrary-precision arithmetic package BigNum (see [SVH89]) so that any program based on that software takes ... See full document

... The arithmetic circuits in Section 5 all have a finite implementation when we interpret each operation modulo an odd number 1 + 2p. In particular, we show in [SV93] how to derive from equation (4) a finite ... See full document

... SECD machine [9]. In fact, our calculus enforces commutativity of these indices and therefore extends the use of de Bruijn offsets for that model of implementation to include label-selective argument passing. In that ... See full document

... method of quadratic resampling yields an error reduction factor ranging from 2 for problems with low correlation to several hundreds for problems with high correlation. Indeed, the cash-flow function is closer to its ... See full document

... Our idea is to represent the (presumably numerous) facts of a LIFE program’s EDB as flat relations to store in an external relational database. Then, designing an interface amounts to defining an intermediate ... See full document

... Roughly, a feature automaton reads a feature tree in two directions: along its branches (from the frontier to the root) and along the fan-out of each node (along all argument positions). This is necessary in order to ... See full document

... Fig. 5 shows the result of the algorithm for a rigid circular brush. Of course, the error tolerance can always be set manually, but in most cases, a default value equal to some fraction of the brush diameter (say ... See full document

... know though that classical Set Theory does not yield models of impredicative Type Theory. However, models may be found as categories which are internal not to the category of sets and functions, but to more ... See full document

... But, besides legibility, the hidden loss is efficiency: a combinator is an explicit closure to build and reduce, whereas label commutation enables direct access into the argument stack with offsets. Moreover, for more ... See full document

... precisely tailored to its function: 16 bits parallel operators for steps 1 through 5, connected according to the schematics below. Step 6 is implemented in a fully bit-serial manner, to take best advantage of the ... See full document

... from 1 to ...dimensions 1, 2, and 3, both put and call prices of options on the maximum of the underlying assets were computed accurately by the SSAP ...from 1 to 400, in accordance with a well known ... See full document

... Table 7: Accuracy of the FSG method measured against the zero-strike average-rate option. Time Steps were set to 1, 2, and 3 days for 3, 6, and 12 months maturities respectively. Table 8 shows that the geometric ... See full document

... ungrasping operations, and transfer motions (i.e. motions of the robot together with a grasped object). The approach is in practice limited to non-redundant robots with few DOF, and requires an exhaustive exploration of ... See full document

... Concerning undecidability of OSF theory unification, a related, but different result was proven by Gert Smolka in [13]. The undecidability of our problem uses explicitly the existence of a model satisfying the sort ... See full document

... The high computational requirements of motion planning are mostly due to the need to perform repeated collision checking between the robot and the obstacles (Metivier and Urbschat 1990 [28]). Detecting the collision of a ... See full document

... Since contraction and weakening have been eliminated, core linear logic is not very expressive. In order to regain expressiveness, new formulae involving the exponentials ! (of course) and ? (why not) are introduced. ... See full document

... The local-minima problem can be addressed at two levels: (1) in the definition of the potential function, by attempting to specify a function with no or few local minima; and (2) in the design of the search ... See full document

... The multiplier is interfaced with an arbitrary-precision arithmetic package [6] so that any program based on that software takes advantage of the PAM without modification. For example, Hans Boehm has run computations for ... See full document

... Modern radio techniques, including radar and spread-spectrum communications, make use of finite sequences of bits exhibiting various correlation properties (e.g. [5], [2] chapters 10 and 12, [1]). The correlation ... See full document