588 search results - page 53 / 118 » Reducibility and Completeness in Private Computations |
TCS
2010
13 years 8 months ago
2010
The paper contains the first complete proof of strong normalization (SN) for full second order linear logic (LL): Girard’s original proof uses a standardization theorem which i...
ICDM
2006
IEEE
14 years 4 months ago
2006
IEEE
Free tree, as a special graph which is connected, undirected and acyclic, is extensively used in domains such as computational biology, pattern recognition, computer networks, XML...
IPPS
1999
IEEE
14 years 2 months ago
1999
IEEE
Massively parallel computers are increasingly being used to solve large, I/O intensive applications in many different fields. For such applications, the I/O requirements quite oft...
HIPC
2009
Springer
13 years 7 months ago
2009
Springer
Large scale compute clusters continue to grow to ever-increasing proportions. However, as clusters and applications continue to grow, the Mean Time Between Failures (MTBF) has redu...
HPDC
1998
IEEE
14 years 2 months ago
1998
IEEE
Abstract Metacomputing is the seamless application of geographically-separated distributed computing resources to user applications. We consider the scheduling of metaapplications;...