Sciweavers

127
Voted
COCO
2000
Springer
107views Algorithms» more  COCO 2000»
15 years 7 months ago
On the Complexity of Intersecting Finite State Automata
We consider the problem of testing whether the intersection of a collection of k automata is empty. The straightforward algorithm for solving this problem runs in time k where is...
George Karakostas, Richard J. Lipton, Anastasios V...
124
Voted
CLUSTER
2000
IEEE
15 years 7 months ago
Madeleine II: a Portable and Efficient Communication Library for High-Performance Cluster Computing
This paper introduces MadeleineII, a new adaptive and portable multi-protocol implementation of the Madeleine communication library. MadeleineII has the ability to control multipl...
Olivier Aumage, Luc Bougé, Alexandre Denis,...
CLUSTER
2000
IEEE
15 years 7 months ago
Efficient Parallel I/O on SCI Connected Clusters
This paper presents a new approach towards parallel I/O for message-passing (MPI) applications on clusters built with commodity hardware and an SCI interconnect: instead of using t...
Joachim Worringen
99
Voted
CLUSTER
2000
IEEE
15 years 7 months ago
Request Rate Adaptive Dispatching Architecture for Scalable Internet Server
Dongeun Kim, Cheol Ho Park, Daeyeon Park
131
Voted
COOPIS
1998
IEEE
15 years 7 months ago
Wrapper Generation for Web Accessible Data Sources
There is an increase in the number of data sources that can be queried across the WWW. Such sources typically support HTML forms-based interfaces and search engines query collecti...
Jean-Robert Gruser, Louiqa Raschid, Maria-Esther V...