Sciweavers

5448 search results - page 730 / 1090
» Breakpoints and Time in Distributed Computations
Sort
View
CORR
2006
Springer
123views Education» more  CORR 2006»
15 years 6 months ago
Counting good truth assignments of random k-SAT formulae
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 ...
Andrea Montanari, Devavrat Shah
GRID
2007
Springer
15 years 6 months ago
A Tool for Prioritizing DAGMan Jobs and its Evaluation
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...
CLUSTER
1999
IEEE
15 years 6 months ago
Experimental measurements and design guidelines for real-time software encryption in multimedia wireless LANs
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...
Aura Ganz, Se Hyun Park, Zvi Ganz
COMCOM
2008
99views more  COMCOM 2008»
15 years 6 months ago
SPICE: Scalable P2P implicit group messaging
Implicit group messaging (IGM) is a decoupled messaging paradigm for connecting content publishers and consumers over the Internet. Unlike traditional multicast or publish/subscri...
Daniel Cutting, Aaron J. Quigley, Björn Landf...
205
Voted
PC
2007
173views Management» more  PC 2007»
15 years 6 months ago
Parallel graphics and visualization
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...
Luís Paulo Santos, Bruno Raffin, Alan Heiri...