13603 search results - page 61 / 2721 » On the Computational Complexity of Cut-Reduction |
CIMAGING
2010
14 years 10 months ago
2010
We present the implementation and evaluation of a penalized alternating minimization (AM) method1 for the computation of a specimen's complex transmittance function (magnitud...
109
click to vote
IACR
2011
13 years 9 months ago
2011
Secure multiparty computation (MPC) allows a set of n players to compute any public function, given as an arithmetic circuit, on private inputs, so that privacy of the inputs as we...
EUROCRYPT
2007
Springer
15 years 1 months ago
2007
Springer
Essentially all work studying the round complexity of secure computation assumes broadcast as an atomic primitive. Protocols constructed under this assumption tend to have very poo...
109
click to vote
SIGGRAPH
1997
ACM
15 years 2 months ago
1997
ACM
Simulating realistic lighting and rendering complex scenes are usually considered separate problems with incompatible solutions. Accurate lighting calculations are typically perfo...
LICS
1999
IEEE
15 years 2 months ago
1999
IEEE
We present some new decision and comparison problems of unusually high computational complexity. Most of the problems are strictly combinatorial in nature; others involve basic lo...