9997 search results - page 239 / 2000 » The case for crowd computing |
117
click to vote
ACRI
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. I argue for the use of a specific type of grid and computational style for computational simulation that utilize emergence to produce results that would resemble physica...
132
click to vote
CIE
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. This paper extends the logical approach to computable analysis via Σ–definability to higher type continuous data such as functionals and operators. We employ definab...
180
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...
157
Voted
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 ...
160
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...