4114 search results - page 251 / 823 » Efficient Algorithms for the 2-Center Problems |
172
click to vote
SRDS
2008
IEEE
16 years 29 days ago
2008
IEEE
Distributed storage systems often use data replication to mask failures and guarantee high data availability. Node failures can be transient or permanent. While the system must ge...
184
click to vote
EDBT
2009
ACM
15 years 10 months ago
2009
ACM
We propose efficient techniques for processing various TopK count queries on data with noisy duplicates. Our method differs from existing work on duplicate elimination in two sign...
149
click to vote
COLT
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We consider the design of online master algorithms for combining the predictions from a set of experts where the absolute loss of the master is to be close to the absolut...
188
click to vote
OPODIS
2001
15 years 8 months ago
2001
In their pioneering paper [4], Gallager et al. introduced a distributed algorithm for constructing the minimum-weight spanning tree (MST), many authors have suggested ways to enhan...
178
click to vote
PRL
2008
15 years 6 months ago
2008
We propose a novel hierarchical clustering algorithm for data-sets in which only pairwise distances between the points are provided. The classical Hungarian method is an efficient...