Search

Search Results

1. Asynchronous privacy-preserving iterative computation on peer-to-peer networks

   Privacy preserving algorithms allow several participants to compute a global function collaboratively without revealing local information to each...

   J. A. M. Naranjo, L. G. Casado, Márk Jelasity in Computing

   Article 26 June 2012

2. DSOL: a declarative approach to self-adaptive service orchestrations

   Service oriented computing (SOC) has brought a simplification in the way distributed applications can be built. Mainstream approaches, however,...

   Gianpaolo Cugola, Carlo Ghezzi, Leandro Sales Pinto in Computing

   Article 29 March 2012

3. The Complexity of Processing Hierarchical Specifications

   Hierarchical object descriptions consisting of a set of module descriptions are considered, where each module is either a primitive module or has a...

   Daniel J. Rosenkrantz, Harry B. Hunt in Fundamental Problems in Computing

   Chapter 2009
   

4. The advantages of Fortran 90

   Fortran 77 is the most widely used language for scientific programming. Its long-awaited revision is now called Fortran 90. It was finalized (down to...

   John Reid in Computing

   Article 01 September 1992

5. Credible execution of bounded-time parallel systems with delayed diagnosis

   This paper presents a forward recovery method for the fault-tolerant execution of parallel software systems on multicomputers such that faults are...

   R. Shankar, D. P. Miranker in Computing

   Article 01 March 1992

6. Nonsymmetric Lanczos and finding orthogonal polynomials associated with indefinite weights

   The nonsymmetric Lanczos algorithm reduces a general matrix to tridiagonal by generating two sequences of vectors which satisfy a mutual...

   Daniel L. Boley, Sylvan Elhay, ... Martin H. Gutknecht in Numerical Algorithms

   Article 01 February 1991