6110 search results - page 148 / 1222 » Approximate Computing |
189
click to vote
FOCS
1992
IEEE
15 years 10 months ago
1992
IEEE
The class PCP(f(n), g(n)) consists of all languages L for which there exists a polynomial-time probabilistic oracle machine that uses O(f(n)) random bits, queries O(g(n)) bits of ...
166
click to vote
CSUR
1999
15 years 6 months ago
1999
useful for optimizing compilers [15], partial evaluators [11], abstract debuggers [1], models-checkers [2], formal verifiers [13], etc. The difficulty of the task comes from the fa...
164
click to vote
CVIU
2008
15 years 6 months ago
2008
The estimation of parametric global motion is one of the cornerstones of computer vision. Such schemes are able to estimate various motion models (translation, rotation, affine, p...
122
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
—We address the problem of estimating a random vector X from two sets of measurements Y and Z, such that the estimator is linear in Y . We show that the partially linear minimum ...
203
click to vote
AAAI
2011
14 years 6 months ago
2011
In this paper, we propose a variant of the conservativeupdate Count-Min sketch to further reduce the overestimation error incurred. Inspired by ideas from lossy counting, we divid...