2168 search results - page 57 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
110
click to vote
SACRYPT
2001
Springer
15 years 8 months ago
2001
Springer
We show that there is a very straightforward closed algebraic formula for the Rijndael block cipher. This formula is highly structured and far simpler then algebraic formulations o...
116
Voted
FPGA
1997
ACM
15 years 7 months ago
1997
ACM
In this paper, we give a necessary and sufficient condition for the existence of partially-dependent functional decomposition and develop new algorithms to compute such decomposi...
125
click to vote
RANDOM
2001
Springer
15 years 8 months ago
2001
Springer
We study integrated prefetching and caching in single and parallel disk systems. A recent approach used linear programming to solve the problem. We show that integrated prefetching...
133
Voted
TOG
2008
15 years 3 months ago
2008
Shadow computation in dynamic scenes under complex illumination is a challenging problem. Methods based on precomputation provide accurate, real-time solutions, but are hard to ex...
101
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
In practical nonlinear filtering, the assessment of achievable filtering performance is important. In this paper, we focus on the problem of how to efficiently approximate the post...