1 Highly Available and Secure Fault-tolerant Mobile Computing Sanjay K. Madria Department of Computer Science University of Missouri-Rolla [email protected].
Concurrency Control for Parallel Machine Learning
1 A Programming model for failure- prone, Collaborative robots Nels Eric Beckman Jonathan Aldrich School of Computer Science Carnegie Mellon University.
Computation and Minimax Risk The most challenging topic… Some recent progress: –tradeoffs between time and accuracy via convex relaxations (Chandrasekaran.
Highly Available and Secure Fault-tolerant Mobile Computing