We present a deterministic approximation algorithm to compute logarithm of the number of `good' truth assignments for a random k-satisfiability (k-SAT) formula in polynomial ...
It is often difficult to perform efficiently a collection of jobs with complex job dependencies due to temporal unpredictability of the grid. One way to mitigate the unpredictabili...
Grzegorz Malewicz, Ian T. Foster, Arnold L. Rosenb...
To secure interactive multimedia applications in wireless LANs WLANs it is pertinent to implement real time cryptographic services. In this paper we evaluate the use of software b...
Implicit group messaging (IGM) is a decoupled messaging paradigm for connecting content publishers and consumers over the Internet. Unlike traditional multicast or publish/subscri...
Parallel volume rendering is one of the most efficient techniques to achieve real time visualization of large datasets by distributing the data and the rendering process over a c...