9716 search results - page 264 / 1944 » The Case for Energy-Proportional Computing |
167
click to vote
CP
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. Computing lower bounds to the best-cost extension of a tuple is an ubiquous task in constraint optimization. A particular case of special interest is the computation of l...
168
click to vote
CONCUR
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. For many cryptographic protocols, security relies on the assumption that adversarial entities have limited computational power. This type of security degrades progressive...
163
click to vote
CTRSA
2008
Springer
15 years 8 months ago
2008
Springer
In the 1980s, Yao presented a very efficient constant-round secure two-party computation protocol withstanding semi-honest adversaries, which is based on so-called garbled circuits...
206
click to vote
EUROPAR
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. Security and fault-tolerance is a big issue for intensive parallel computing in pervasive environments with hardware errors or malicious acts that may alter the result. I...
141
click to vote
NIPS
2004
2004
Methods for Estimating the Computational Power and Generalization Capability of Neural Microcircuits
15 years 8 months ago
What makes a neural microcircuit computationally powerful? Or more precisely, which measurable quantities could explain why one microcircuit C is better suited for a particular fa...