1534 search results - page 126 / 307 » Stochastic Bounds on Execution Times of Parallel Computation... |
JSSPP
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. This paper empirically explores the advantages of the collaboration between different parallel compute sites in a decentralized grid scenario. To this end, we assume ind...
COLT
1994
Springer
14 years 2 months ago
1994
Springer
: Sequential algorithms given by Angluin 1987 and Schapire 1992 learn deterministic nite automata DFA exactly from Membership and Equivalence queries. These algorithms are feasible...
AUSAI
2003
Springer
14 years 3 months ago
2003
Springer
Efficient mining of frequent patterns from large databases has been an active area of research since it is the most expensive step in association rules mining. In this paper, we pr...
SCCC
1998
IEEE
14 years 2 months ago
1998
IEEE
We present a scalable algorithm for the parallel computation of inverted files for large text collections. The algorithm takes into account an environment of a high bandwidth netw...
LATA
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. This paper contributes to the study of Freely Rewriting Restarting Automata (FRR-automata) and Parallel Communicating Grammar Systems (PCGS) as formalizations of the ling...