Sciweavers

2214 search results - page 63 / 443
» complexity 2004
Sort
View
WIA
2004
Springer
14 years 1 months ago
Brute Force Determinization of NFAs by Means of State Covers
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...
BXML
2004
13 years 9 months ago
Using semantic Web services for ad hoc collaboration in virtual teams
: 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...
Matthias Flügge, Kay-Uwe Schmidt
COMCOM
2004
81views more  COMCOM 2004»
13 years 7 months ago
A performance anomaly in clustered on-line transaction processing systems
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...
Hong Cai, Hisao Kameda, Jie Li
TOC
2010
123views Management» more  TOC 2010»
13 years 2 months ago
Rounds vs. Queries Tradeoff in Noisy Computation
: 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 ...
Navin Goyal, Michael Saks
GRID
2004
Springer
14 years 1 months ago
An Early Evaluation of WSRF and WS-Notification via WSRF.NET
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...