6110 search results - page 85 / 1222 » Approximate Computing |
159
click to vote
CASC
2009
Springer
16 years 23 days ago
2009
Springer
This work addresses the problem of computing a certified ǫ-approximation of all real roots of a square-free integer polynomial. We proof an upper bound for its bit complexity, b...
155
click to vote
LICS
2009
IEEE
16 years 25 days ago
2009
IEEE
In this paper we introduce “clipping,” a new method of syntactic approximation which is motivated by and works in conjunction with a sound and decidable denotational model for...
161
click to vote
SC
1995
ACM
15 years 9 months ago
1995
ACM
Matrix-vector products (mat-vecs) form the core of iterative methods used for solving dense linear systems. Often, these systems arise in the solution of integral equations used i...
179
click to vote
SIAMCOMP
1998
15 years 5 months ago
1998
Polynomial-time safe and unsafe approximations for intractable sets were introduced by Meyer and Paterson [Technical Report TM-126, Laboratory for Computer Science, MIT, Cambridge,...
164
click to vote
SI3D
2009
ACM
16 years 1 months ago
2009
ACM
Physically plausible illumination at real-time framerates is often achieved using approximations. One popular example is ambient occlusion (AO), for which very simple and efficie...