9997 search results - page 268 / 2000 » The case for crowd computing |
169
click to vote
EUROCRYPT
1998
Springer
15 years 10 months ago
1998
Springer
Abstract. This paper describes e cient protocols for multi-party computations that are information-theoretically secure against passive attacks. The results presented here apply to...
174
click to vote
TPPP
1994
15 years 10 months ago
1994
Time can be understood as dual to information in extant models of both sequential and concurrent computation. The basis for this duality is phase space, coordinatized by time and ...
149
click to vote
COCOA
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. This paper proposes a method to compute the transitive closure of a union of affine relations on integer tuples. Within Presburger arithmetics, complete algorithms to com...
164
click to vote
COMPGEOM
2004
ACM
15 years 10 months ago
2004
ACM
The Bentley-Ottmann sweep-line method can be used to compute the arrangement of planar curves provided a number of geometric primitives operating on the curves are available. We d...
189
click to vote
CCGRID
2001
IEEE
15 years 10 months ago
2001
IEEE
Resource management is an important infrastructure in the grid computing environment. Scalability and adaptability are two key challenges in the implementation of such complex sof...