61 search results - page 4 / 13 » An empirical study of a scalable Byzantine agreement algorit... |
ICDM
2007
IEEE
14 years 1 months ago
2007
IEEE
In this paper we address the problem of combining multiple clusterings without access to the underlying features of the data. This process is known in the literature as clustering...
KDD
1999
ACM
13 years 11 months ago
1999
ACM
We propose to use AdaBoost to efficiently learn classifiers over very large and possibly distributed data sets that cannot fit into main memory, as well as on-line learning wher...
ISSTA
2010
ACM
13 years 9 months ago
2010
ACM
This paper presents a new technique, called Symbolic Program Decomposition (or SPD), for symbolic execution of multiple paths that is more scalable than existing techniques, which...
CISIS
2008
IEEE
14 years 1 months ago
2008
IEEE
In 2006, John Mellor-Crummey and Michael Scott received the Dijkstra Prize in Distributed Computing. This prize was for their 1991 paper on algorithms for scalable synchronization ...
JPDC
2008
13 years 7 months ago
2008
In this paper, we present parallel multilevel algorithms for the hypergraph partitioning problem. In particular, we describe schemes for parallel coarsening, parallel greedy k-way...