2168 search results - page 143 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
120
click to vote
AMDO
2004
Springer
15 years 9 months ago
2004
Springer
In this paper, a method for image deformation is presented. It is based upon decomposition of the deformation problem into basic physical laws. Unlike other methods that solve a di...
237
click to vote
AFPAC
2000
Springer
15 years 8 months ago
2000
Springer
Abstract. Most of the processing in vision today uses spatially invariant operations. This gives efficient and compact computing structures, with the conventional convenient separa...
137
click to vote
ISCAS
2005
IEEE
15 years 9 months ago
2005
IEEE
Although many researches have investigated transparent scrambling video techniques, an issue of which transcoding relates to downsizing scrambled video without unscrambling has ha...
138
click to vote
CCGRID
2009
IEEE
15 years 8 months ago
2009
IEEE
In large-scale clusters and computational grids, component failures become norms instead of exceptions. Failure occurrence as well as its impact on system performance and operatio...
146
click to vote
SIAMCOMP
2010
15 years 2 months ago
2010
The classical direct product theorem for circuits says that if a Boolean function f : {0, 1}n → {0, 1} is somewhat hard to compute on average by small circuits, then the correspo...