We address the issue of computing power spectral density (PSD) estimates at the output of a beamforming sensor array in the presence of strong moving interference. It is shown that...
Researchers have made great strides in improving the fault tolerance of both centralized and replicated systems against arbitrary (Byzantine) faults. However, there are hard limit...
Byung-Gon Chun, Petros Maniatis, Scott Shenker, Jo...
We propose a provably efficient application-controlled global strategy for organizing a cache of size k shared among P application processes. Each application has access to informa...
Rakesh D. Barve, Edward F. Grove, Jeffrey Scott Vi...
Dining philosophers is a classic scheduling problem for local mutual exclusion on arbitrary conflict graphs. We establish necessary conditions to solve wait-free dining under even...
Initiating and bootstrapping secure, yet low-cost, ad-hoc transactions is an important challenge that needs to be overcome if the promise of mobile and pervasive computing is to b...