As computational clusters increase in size, their mean-time-to-failure reduces. Typically checkpointing is used to minimize the loss of computation. Most checkpointing techniques, ...
This paper describes a choice strategy to ease user’s burdens for an interactive object recognition system when the system obtains multiple object candidates as a recognition re...
Yasushi Makihara, Jun Miura, Yoshiaki Shirai, Nobu...
Abstract - Parallel algorithms of the hypercube allocation strategies are considered in this paper. Although the sequential algorithms of various hypercube allocation strategies ar...
The divide-and-conquer pattern of parallelism is a powerful approach to organize parallelism on problems that are expressed naturally in a recursive way. In fact, recent tools such...
For many Internet applications, the ability to protect the identity of participants in a distributed applications is critical. For such applications, a number of anonymous communi...