1999 search results - page 143 / 400 » Dependently Typed Grammars |
186
click to vote
RC
2007
15 years 5 months ago
2007
The search algorithm presented allows the CDF of a dependent variable to be bounded with 100%confidence,andallowsforaguaranteedevaluationof theerror involved.Thesereliabilitybound...
295
click to vote
MICRO
2012
IEEE
13 years 8 months ago
2012
IEEE
This article presents a general algorithm for transforming sequential imperative programs into parallel data-flow programs. Our algorithm operates on a program dependence graph i...
160
click to vote
GLOBECOM
2006
IEEE
16 years 13 days ago
2006
IEEE
— This work presents a statistical field study of the availability of time sources for location in a true wireless network. Terrestrial (base stations) and satellite (GPS) source...
191
click to vote
INFORSID
1996
15 years 7 months ago
1996
: This paper presents a propagation model for complex object versions. Complex objects are object linked to other objects by means of dependence relations such as composition, inhe...
155
click to vote
JAT
2002
15 years 6 months ago
2002
Let f C[-1, 1] change its convexity finitely many times, in the interval. We are interested in estimating the degree of approximation of f by polynomials which are coconvex with i...