29152 search results - page 247 / 5831 » A Model of Computation for MapReduce |
152
click to vote
AINA
2003
IEEE
15 years 12 months ago
2003
IEEE
This paper introduces a novel reprocessingtransaction model that handles the update conflicts between mobile transactions without abortion. The proposed model executes a new subtr...
146
click to vote
ICRA
1994
IEEE
15 years 10 months ago
1994
IEEE
This paper describes an efficient algorithm for computing the distance between non-convex objects. Objects are modeled as the union of a set of convex components. From this model ...
169
click to vote
FMCO
2006
Springer
15 years 10 months ago
2006
Springer
d Abstract) Vladimiro Sassone1 , Karl Krukow2 , and Mogens Nielsen2 1 ECS, University of Southampton 2 BRICS , University of Aarhus We define a mathematical measure for the quantit...
166
click to vote
ASIACRYPT
2008
Springer
15 years 8 months ago
2008
Springer
Recently, Desmedt et al. studied the problem of achieving secure n-party computation over non-Abelian groups. They considered the passive adversary model and they assumed that the...
144
click to vote
WSC
2004
15 years 8 months ago
2004
We consider the optimal computing budget allocation (OCBA) problem where the simulated designs are correlated. The exact optimal allocation is presented for two designs, and an ap...