2168 search results - page 64 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
150
click to vote
CAP
2010
14 years 10 months ago
2010
We present a parallel algorithm for exact division of sparse distributed polynomials on a multicore processor. This is a problem with significant data dependencies, so our solutio...
100
click to vote
ICML
2006
IEEE
16 years 4 months ago
2006
IEEE
We consider the sparse grid combination technique for regression, which we regard as a problem of function reconstruction in some given function space. We use a regularised least ...
108
Voted
ICIP
2009
IEEE
16 years 4 months ago
2009
IEEE
This paper presents a novel method to approximate shiftvariant Gaussian filtering of an image using a set of shiftinvariant Gaussian filters. This approximation affords filtering ...
185
Voted
CPM
1998
Springer
15 years 7 months ago
1998
Springer
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
148
Voted
MM
2005
ACM
15 years 9 months ago
2005
ACM
Graphics and vision are approximate inverses of each other: ordinarily Graphics Processing Units (GPUs) are used to convert “numbers into pictures” (i.e. computer graphics). I...