2720 search results - page 534 / 544 » How do we count |
ICS
2011
Tsinghua U.
12 years 10 months ago
2011
Tsinghua U.
Applications must scale well to make efficient use of even medium-scale parallel systems. Because scaling problems are often difficult to diagnose, there is a critical need for sc...
CAISE
1999
Springer
13 years 11 months ago
1999
Springer
The support of process enactment through the use of workflow management systems has gained considerable attention within the last few years. We develop a classification framework c...
PKC
2012
Springer
11 years 9 months ago
2012
Springer
Gentry’s bootstrapping technique is currently the only known method of obtaining a “pure” fully homomorphic encryption (FHE) schemes, and it may offers performance advantage...
JCB
2002
13 years 7 months ago
2002
This paper investigates the standard ordinary least-squares version 24 and the balanced version 20 of the minimum evolution principle. For the standard version, we provide a greedy...
PODC
2009
ACM
14 years 8 months ago
2009
ACM
Performing random walks in networks is a fundamental primitive that has found applications in many areas of computer science, including distributed computing. In this paper, we fo...