[PDF] Top 20 PRL RR 2 pdf

... Nous d´ecrivons un module C d’arithm´etique enti`ere `a pr´ecision arbitraire, portable, mais n´eanmoins efficace. La rapidit´e d’ex´ecution de ce module est assujettie `a la r´e´ecriture en langage machine du noyau du ... See full document

... To define feature automata as algebras, it is useful to consider the class of all finite trees whose nodes are labeled by node symbols, and whose edges are labeled by feature symbols. We call these multitrees. 2 ... See full document

... each other. (We will see later that this correspondance is a formal one for satisfiability, but nor for entailment.) Now it becomes clear what we mean by saying that feature constraints are finer grained. Also, feature ... See full document

... that, in Fc, if two second-order terms coincide on an input type, then they are, in fact, the same function. Or, equivalently, that each input type acts as a generic input, as a variable. It also says, in a sense, that ... See full document

... To make quantitative comparisons significant across such a wide spectrum of feasible implementation technologies, we introduce a common unit for measuring all forms of computing power, the Gbops (billion of binary ... See full document

... Our interest in planar maps is motivated by practical concerns: with traditional graphic arts media (pencil, eraser, ink, etc.), it is common practice to build shapes by drawing lines and curves, erase some pieces ... See full document

... A direct consequence of Definition 1 is that all delays in a digital circuit are exact integers. In particular, combinational circuits have zero delay: the output response to changes in the inputs is instantaneous, and ... 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 ... See full document

... We propose a formal design for an effective coupling of such a language with a relational database. For the purpose of our presentation and experimentation, we use the specific language LIFE [2], but this implies ... See full document

... has 2 more control points than a cubic curve, and therefore more freedom to satisfy the same constrained least squares equations. A direct consequence is that although it could still be used to improve the fit as ... See full document

... Adding to our previous design an additional counter that is stoppable and loadable, and modifying the kernel to restore and save this second counter on context entry and exit provides a high resolution timer that runs in ... See full document

... We give conditions for the existence of non-trivial models for OSF theories, and prove the undecidability of the OSF theory unification problem. We also show that failure of OSF theory unification (i.e., ... See full document

... A widely used heuristic consists in guiding the robot along the negated gradient of a real-valued function defined over the configuration space, called the potential function. The potential has two components: a goal ... See full document

... assigned to the robot is simply a pick and place operation consisting of moving M to another location. Hence, in this case, it is easy to imagine how the problem should be addressed. First, the robot must move its end ... See full document

... on the right with s must be done such that the relative positions be kept in coherence. Now, r expects t 1 in second position and t 2 in fourth position. In other words, positions 1, 3, 5 and up, are “free” in r ... 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

... In order to speed-up the Monte Carlo simulation of conditional probabilities, we developed an original variance reduction technique called Quadratic Resampling. Quadratic Resampling was originally presented in Barraquand ... See full document

... PAM 2 , at performance and cost comparable to those of fully dedicated implementations: orders of magnitude faster than any general purpose implementation, in ... See full document

... LIFE is a trinity. The function-oriented component of LIFE is directly derived from functional programming languages with higher-order functions as first-class objects, data constructors, and algebraic pattern-matching ... See full document

... A hardware accelerator for data compression was implemented in four months by Marcin Skubiszewski, who had no previous hardware experience. Based on an algorithm described in [2], it is a massively parallel method ... See full document