Sciweavers

9997 search results - page 348 / 2000
» The case for crowd computing
Sort
View
RANDOM
1998
Springer
15 years 11 months ago
Using Approximation Hardness to Achieve Dependable Computation
Abstract. Redundancy has been utilized to achieve fault tolerant computation and to achieve reliable communication in networks of processors. These techniques can only be extended ...
Mike Burmester, Yvo Desmedt, Yongge Wang
CTRSA
2009
Springer
179views Cryptology» more  CTRSA 2009»
16 years 1 months ago
Adaptively Secure Two-Party Computation with Erasures
In the setting of multiparty computation a set of parties with private inputs wish to compute some joint function of their inputs, whilst preserving certain security properties (l...
Andrew Y. Lindell
WORDS
2003
IEEE
15 years 12 months ago
Improving Dependability of Service Oriented Architectures for Pervasive Computing
Service Oriented Programming - which combines Distributed Object Compunting, Component Based and webbased concepts - has recently emerged as a promising approach to develop dynami...
Domenico Cotroneo, Cristiano di Flora, Stefano Rus...
DIGRA
2003
Springer
15 years 12 months ago
Exploration in computer games - a new starting point
Space, vast lands and dungeons… It is no coincidence that Space War and Adventure are among the best known of the first computer games. Both clearly appeal to the player’s cur...
Simon Egenfeldt-Nielsen
IPPS
1999
IEEE
15 years 11 months ago
The Impact of Memory Hierarchies on Cluster Computing
Using off-the-shelf commodity workstations and PCs to build a cluster for parallel computing has become a common practice. A choice of a cost-effective cluster computing platform ...
Xing Du, Xiaodong Zhang