9716 search results - page 201 / 1944 » The Case for Energy-Proportional Computing |
197
click to vote
CTRSA
2008
Springer
15 years 8 months ago
2008
Springer
In the setting of secure multiparty computation, a set of mutually distrustful parties wish to securely compute some joint function of their private inputs. The computation should...
168
click to vote
GD
2006
Springer
15 years 10 months ago
2006
Springer
We prove that computing a geometric minimum-dilation graph on a given set of points in the plane, using not more than a given number of edges, is an NP-hard problem, no matter if ...
167
click to vote
TCOM
2011
15 years 1 months ago
2011
— The computational complexity of optimum decoding for an orthogonal space-time block code is quantified. Four equivalent techniques of optimum decoding which have the same comp...
159
click to vote
IJON
2006
15 years 6 months ago
2006
This paper studies new spike-based models for winner-take-all computation and coincidence detection. In both cases, very fast convergence is achieved independent of initial condit...
215
click to vote
LOGCOM
2008
15 years 6 months ago
2008
We investigate mathematical modelling with theories of data types. We provide a formal setting for the formulation of such theories (TPL) and use it to introduce the notion of a c...