Finite automata determinization is a critical operation for numerous practical applications such as regular expression search. Algorithms have to deal with the possible blow up of ...
Jean-Marc Champarnaud, Fabien Coulon, Thomas Paran...
: The system presented in this paper shows an alternative solution for the communication problem in virtual teams. Although it does not address the full bandwidth of tasks of an gr...
This paper presents a simulation study on complex On-Line Transaction Processing systems using TPC-C workload. The impacts on the response time of Inter-Connection Network (ICN) i...
: We show that a noisy parallel decision tree making O(n) queries needs (log n) rounds to compute OR of n bits. This answers a question of Newman [IEEE Conference on Computational ...
The Web Services Resource Framework (WSRF) and its companion WS-Notification were introduced in January 2004 as a new model on which to build Grids. This paper contains early obse...
Marty A. Humphrey, Glenn S. Wasson, Mark M. Morgan...